Scheduling a hybrid flowshop with batch production at the last stage

Xuan, Hua; Tang, Lixin

doi:10.1016/j.cor.2005.10.014

Cited by 110 publications

(44 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Heuristics for the HFS with m-stages, uniform parallel machines and makespan criterion are due to [176] and [107]. [223] study the case where the last of m stages is a batching stage. The results over a large set of small instances indicated that the proposed heuristic obtains close to optimal solutions for very small problem instances.…”

Section: Heuristicsmentioning

confidence: 99%

The hybrid flow shop scheduling problem

Ruíz

Vázquez-Rodríguez

2010

European Journal of Operational Research

680

236

View full text Add to dashboard Cite

The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many real world applications. Given its importance and complexity, the HFS problem has been intensively studied. This paper presents a literature review on exact, heuristic and metaheuristic methods that have been proposed for its solution.The paper discusses several variants of the HFS problem, each in turn considering different assumptions, constraints and objective functions. Research opportunities in HFS are also discussed.

show abstract

Section: Heuristicsmentioning

confidence: 99%

The hybrid flow shop scheduling problem

Ruíz

Vázquez-Rodríguez

2010

European Journal of Operational Research

680

236

View full text Add to dashboard Cite

show abstract

“…The Shifting Bottleneck (SB) heuristic for the jobshop problem can be adapted to solve the FFS problem (Pinedo 1994). Other configurations of the FFS with various sets of constraints or objective functions have also been studied: availability constraints (Allaoui and Artiba 2006), flow time minimization or total completion time (Azizoglu et al 2001;Guinet and Solomon 1996), job recirculation (Bertel and Billaut 2004), precedence constraints (Botta-Genoulaz 2000; Tang et al 2006), state-dependent processing times (Sriskandarajah and Wagneur 1991), limited intermediate storage (Sawik 2002), pre-emption in job processing (Djellab and Djellab 2002), or even batch processing of jobs (Xuan and Tang 2007). Integrated planning and scheduling approach for shops with multiple processors in parallel has also been proposed (Riane et al 2001).…”

Section: Introductionmentioning

confidence: 99%

Scheduling jobs on a k-stage flexible flow-shop

et al. 2007

View full text Add to dashboard Cite

We consider the problem of makespan minimization on a flexible flow shop with k stages and m s machines at any stage. We propose a heuristic algorithm based on the identification and exploitation of the bottleneck stage, which is simple to use and to understand by practitioners. A computational experiment is conducted to evaluate the performance of the proposed method. The study shows that our method is, in average, comparable with other bottleneck-based algorithms, but with smaller variance, and that it requires less computational effort.

show abstract

“…Most of such studies deal with problems in which ready times of jobs are not considered, that is, ready times of the jobs are 0. Among these, Arthanary and Ramaswamy (1971), Mittal and Nagga (1973), Narasimhan and Panwalkar (1984), Gupta (1988), Sriskandarajah and Sethi (1989), Gupta andTunc (1991, 1994), Rajendran and Chaudhuri (1992), Lee and Vairaktarakis (1994), Chen (1995), Hoogeveen et al (1996), Guinet and Solomon (1996), Gupta et al (1997), Oguz et al (1997), Lee and Park (1999), Soewandi and Elmaghraby (2003), Cheng et al (2004), , and Zhang et al (2005) focus on the hybrid flowshop problems with two stages, while Paul (1979), Kochhar and Morris (1987), Wittrock (1988), Brah and Hunsucker (1991), Riane et al (1998), Serifoglu and Ulusoy (2004), Choi et al (2005), Jin et al (2006), Lee (2006), Ruiz and Maroto (2006), Tang et al (2006), Ying and Lin (2006), Janiak et al (2007), Quadt and Kuhn (2007), Vosz and Witt (2007), and Xuan and Tang (2007) focus on those with more than two stages. On the other hand, suggest a bottleneck-focused scheduling algorithm for a multi-stage hybrid flowshop scheduling problem, in which scheduling at the bottleneck workstation is done using estimated job ready times.…”

mentioning

confidence: 98%

Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint

2007

View full text Add to dashboard Cite

This paper focuses on the scheduling problem of minimizing makespan for a given set of jobs in a two-stage hybrid flowshop subject to a product-mix ratio constraint. There are identical parallel machines at the first stage of the hybrid flowshop, while there is a single batch-processing machine at the second stage. Ready times of the jobs (at the first stage) may be different, and a given product-mix ratio of job types should be kept in each batch at the second stage. We present three types of heuristic algorithms: forward scheduling algorithms, backward scheduling algorithms, and iterative algorithms. To evaluate performance of the suggested algorithms, a series of computational experiments are performed on randomly generated test problems and results are reported.Keywords Scheduling · Heuristics · Hybrid flowshop · Product-mix ratio · MakespanWe consider a scheduling problem in a hybrid flowshop (HFS). In a typical HFS, there are K serial workstations and there are multiple parallel machines at one or more workstations. This paper focuses on a two-stage hybrid flowshop in which there are multiple identical parallel machines at the first stage and a single batch-processing machine at the second stage. In the HFS considered in this study, there are two types of jobs, and a given product-mix ratio of the two job types should be kept in each batch at the second stage. Also, jobs arrive at the first stage dynamically, that is,

show abstract

Scheduling a hybrid flowshop with batch production at the last stage

Cited by 110 publications

References 19 publications

The hybrid flow shop scheduling problem

The hybrid flow shop scheduling problem

Scheduling jobs on a k-stage flexible flow-shop

Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint

Contact Info

Product

Resources

About