A heuristic for two-stage no-wait hybrid flowshop scheduling with a single machine in either stage

This paper studies the hybrid flow-shop scheduling problem with no-wait restriction. The production process consists of two machine centers, one has a single machine and the other has more than one parallel machines. A greedy heuristic named Least Deviation (LD) algorithm is designed and its worst case performance is analyzed. Computational results are also given to show the algorithm's average performance compared with some other algorithms. LD algorithm outperforms the others in most practical cases discussed here, and it is of low computational complexity and is

[1]  Chelliah Sriskandarajah,et al.  Scheduling algorithms for flexible flowshops: Worst and average case performance , 1988 .

[2]  Tariq A. Aldowaisan.  A new heuristic and dominance relations for no-wait flowshops with setups , 2001, Comput. Oper. Res..

[3]  T. P. Bagchi,et al.  Lot streaming and scheduling heuristics for m -machine no-wait flowshops , 2000 .

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Chelliah Sriskandarajah,et al.  Performance of scheduling algorithms for no-wait flowshops with parallel machines , 1988 .

[6]  Ali Allahverdi,et al.  Total flowtime in no-wait flowshops with separated setup times , 1998, Comput. Oper. Res..

[7]  Chelliah Sriskandarajah,et al.  Minimizing Cycle Time in a Blocking Flowshop , 2000, Oper. Res..

[8]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[9]  Tadeusz Sawik,et al.  Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers , 2000 .

[10]  Lucio Bianco,et al.  Flow Shop No-Wait Scheduling With Sequence Dependent Setup Times And Release Dates , 1999 .

[11]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[12]  Alessandro Agnetis,et al.  No-wait flow shop scheduling with large lot sizes , 1997, Ann. Oper. Res..

[13]  C. Rajendran.  Formulations and heuristics for scheduling in a Kanban flowshop to minimize the sum of weighted flowtime, weighted tardiness and weighted earliness of containers , 1999 .

[14]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .