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

Journal of Heuristics

Volumn 15, Issue 1, 2009, Pages 19-42

  Kim, Yeong Dae ^a   Joo, Byung Jun ^a   Shin, Jong Ho ^b  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b EPFL   (Switzerland)

Author keywords

Heuristics; Hybrid flowshop; Makespan; Product mix ratio; Scheduling

Indexed keywords

BUSINESS MACHINES; COMPUTATIONAL METHODS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; SCHEDULING; TELECOMMUNICATION NETWORKS;

COMPUTATIONAL EXPERIMENTS; HEURISTICS; HYBRID FLOWSHOP; IDENTICAL PARALLEL MACHINES; ITERATIVE ALGORITHMS; MAKESPAN; MINIMIZING MAKESPAN; PROCESSING MACHINES; PRODUCT-MIX RATIO; SCHEDULING PROBLEMS; TEST PROBLEMS;

SCHEDULING ALGORITHMS;

EID: 58149498856     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-007-9061-z     Document Type: Article

References (54)

1. T.S. Arthanary K.G. Ramaswamy 1971 An extension of two machine sequencing problem Opsearch 8 4 10 22
2. S.A. Brah J.L. Hunsucker 1991 Branch and bound algorithm for the flow shop with multiple processors Eur. J. Oper. Res. 51 1 88 99
3. B. Chen 1995 Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at one stage J. Oper. Res. Soc. 46 2 234 244
4. T.C.E. Cheng 1989 A heuristic for common due-date assignment and job scheduling on parallel machines J. Oper. Res. Soc. 40 12 1129 1135
5. T.C.E. Cheng M.Y. Kovalyov K.N. Chakhlevich 2004 Batching in a two-stage flowshop with dedicated machines in the second stage IIE Trans. 36 1 87 93
6. S.-W. Choi Y.-D. Kim G.-C. Lee 2005 Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop Int. J. Prod. Res. 43 11 2149 2167
7. E.G. Coffman Jr. M.R. Garey D.S. Johnson 1978 An application of bin-packing to multiprocessor scheduling SIAM J. Comput. 7 1 1 17
8. max problem J. Heuristics 10 2 169 204
9. P.M. Franca M. Gendreau G. Laporte F.M. Muller 1994 A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective Comput. Oper. Res. 21 2 205 210
10. D.K. Friesen 1984 Tighter bounds for the MULTIFIT processor scheduling algorithm SIAM J. Comput. 13 1 170 181
11. M.R. Garey D.S. Johnson 1978 Strong NP-completeness results: motivation, examples and implications J. Assoc. Comput. Mach. 25 499 508
12. A.G.P. Guinet M.M. Solomon 1996 Scheduling hybrid flowshops to minimize maximum tardiness and maximum completion time Int. J. Prod. Res. 34 6 1643 1654
13. J.N.D. Gupta 1988 Two-stage, hybrid flowshop scheduling problem J. Oper. Res. Soc. 39 4 359 364
14. J.N.D. Gupta E.A. Tunc 1991 Schedules for a two stage hybrid flowshop with parallel machines at the second stage Int. J. Prod. Res. 29 7 1489 1502
15. J.N.D. Gupta E.A. Tunc 1994 Scheduling a two stage hybrid flowshop with separable setup and removal times Eur. J. Oper. Res. 77 3 415 428
16. J.N.D. Gupta A.M.A. Hariri C.N. Potts 1997 Scheduling a two stage hybrid flowshop with parallel machines at the first stage Ann. Oper. Res. 69 171 191
17. J.A. Hoogeveen J.K. Lenstra B. Veltman 1996 Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard Eur. J. Oper. Res. 89 1 172 175
18. Y. Ikura M. Gimple 1986 Efficient scheduling algorithm for a single batch processing machine Oper. Res. Lett. 5 2 61 65
19. A. Janiak E. Kozan M. Lichtenstein C. Oguz 2007 Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion Int. J. Prod. Econ. 105 2 407 424
20. Z. Jin Z. Yang T. Ito 2006 Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem Int. J. Prod. Econ. 100 2 322 334
21. B.-J. Joo Y.-D. Kim 2007 An optimal solution algorithm for a batch-processing machine scheduling problem with a product-mix ratio constraint Int. J. Ind. Eng. 14 2 198 202
22. Y.-D. Kim 1987 On the superiority of a backward approach in list scheduling algorithms for multi-machine makespan problems Int. J. Prod. Res. 25 12 1751 1759
23. Y.-D. Kim 1995 A backward approach in list scheduling algorithms for multi-machine tardiness problems Comput. Oper. Res. 22 3 307 319
24. T. Kis E. Pesch 2005 A review of exact solution methods for the non-preemptive multiprocessor flowshop problem Eur. J. Oper. Res. 164 3 592 608
25. S. Kochhar R.J.T. Morris 1987 Heuristic methods for flexible flow line scheduling J. Manuf. Syst. 6 4 299 314
26. C.P. Koulamas 1997 Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem Nav. Res. Logist. 44 1 109 125
27. C.-Y. Lee G.L. Vairaktarakis 1994 Minimizing makespan in hybrid flowshops Oper. Res. Lett. 16 3 149 158
28. C.-Y. Lee R. Uzsoy L.A. Martin-Vega 1992 Efficient algorithms for scheduling semiconductor burn-in operations Oper. Res. 40 4 764 775
29. G.-C. Lee 2006 Scheduling methods for a hybrid flowshop with dynamic order arrival J. Korean Inst. Ind. Eng. 32 4 373 381
30. G.-C. Lee Y.-D. Kim 2004 A Branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness Int. J. Prod. Res. 42 22 4731 4743
31. G.-C. Lee Y.-D. Kim S.-W. Choi 2004 Bottleneck-focused scheduling for a hybrid flowshop Int. J. Prod. Res. 42 1 165 181
32. J.-S. Lee S.-H. Park 1999 Scheduling heuristics for a two-stage hybrid flowshop with non-identical parallel machines J. Korean Inst. Ind. Eng. 25 2 254 265
33. C.-L. Li C.-Y. Lee 1997 Scheduling with agreeable release times and due dates on a batch-processing machine Eur. J. Oper. Res. 96 3 564 569
34. R. Linn W. Zhang 1999 Hybrid flowshop scheduling: a survey Comput. Ind. Eng. 37 1-2 57 61
35. B.S. Mittal P.C. Nagga 1973 Two machine sequencing problem with parallel machines Opsearch 10 10 22
36. S.L. Narasimhan S.S. Panwalkar 1984 Scheduling in a two-stage manufacturing process Int. J. Prod. Res. 22 4 555 564
37. J.J. Neale I. Duenyas 2000 Control of manufacturing networks which contain a batch processing machine IIE Trans. 32 11 1027 1041
38. C. Oguz B.M.T. Lin T.C.E. Cheng 1997 Two-stage flowshop scheduling with a common second-stage machine Comput. Oper. Res. 24 12 1169 1174
39. S.S. Panwalkar M.L. Smith C.P. Koulamas 1993 A heuristic for the single machine tardiness problem Eur. J. Oper. Res. 70 3 304 310
40. R.J. Paul 1979 A production scheduling problem in the glass-container industry Oper. Res. 27 2 290 302
41. D. Quadt H. Kuhn 2007 A taxonomy of flexible flow line scheduling procedures Eur. J. Oper. Res. 178 3 686 698
42. C. Rajendran D. Chaudhuri 1992 Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan Int. J. Prod. Econ. 27 2 137 143
43. F. Riane A. Artiba S.E. Elmaghraby 1998 A hybrid three-stage flowshop problem: efficient heuristics to minimize makespan Eur. J. Oper. Res. 109 2 321 329
44. R. Ruiz C. Maroto 2006 A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility Eur. J. Oper. Res. 169 3 781 800
45. F.S. Serifoglu G. Ulusoy 2004 Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach J. Oper. Res. Soc. 55 5 504 512
46. H. Soewandi S.E. Elmaghraby 2003 Sequencing on two-stage hybrid flowshop with uniform machines to minimize makespan IIE Trans. 35 5 467 477
47. C. Sriskandarajah S.P. Sethi 1989 Scheduling algorithms for flexible flowshops: worst and average case performance Eur. J. Oper. Res. 43 2 143 160
48. C.S. Sung Y.I. Choung 2000 Minimizing makespan on a single burn-in oven in semiconductor manufacturing Eur. J. Oper. Res. 120 3 559 574
49. L. Tang H. Xuan J. Liu 2006 A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time Comput. Oper. Res. 33 11 3344 3359
50. S. Vosz A. Witt 2007 Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: a real-world application Int. J. Prod. Econ. 105 2 445 458
51. R.J. Wittrock 1988 An adaptable scheduling algorithm for flexible flow lines Oper. Res. 36 3 445 453
52. H. Xuan L. Tang 2007 Scheduling a hybrid flowshop with batch production at the last stage Comput. Oper. Res. 34 9 2718 2733
53. K.-C. Ying S.-W. Lin 2006 Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach Int. J. Prod. Res. 44 16 3161 3177
54. W. Zhang C. Yin J. Liu R.J. Linn 2005 Multi-job lot streaming to minimize the mean completion time in m-1 hybrid flowshops Int. J. Prod. Econ. 96 2 189 200