Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop

References

• Bertel , S and Billaut , JC . 2004 . A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation . Eur. J. Oper. Res. , 159 : 651
   Web of Science ®Google Scholar
• Brah , SA . 1996 . A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors . Prod. Plan. Contr. , 7 : 362
   Web of Science ®Google Scholar
• Brah , SA and Loo , LL . 1999 . Heuristics for scheduling in a flow shop with multiple processors . Eur. J. Oper. Res. , 113 : 113
   Web of Science ®Google Scholar
• Cheng , J , Karuno , Y and Kise , H . 2001 . A shifting bottleneck approach for a parallel-machine flowshop scheduling problem . J. Oper. Res. Soc. Japan , 44 : 140
   Google Scholar
• Drobouchevitch , IG and Strusevich , VA . 1999 . A heuristic algorithm for two-machine re-entrant shop scheduling . Ann. Oper. Res. , 86 : 417
   Web of Science ®Google Scholar
• Guinet , AGP and Solomon , MM . 1996 . Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time . Int. J. Prod. Res. , 34 : 1643
   Web of Science ®Google Scholar
• Gupta , JND and Tunc , EA . 1991 . Schedules for a two stage hybrid flowshop with parallel machines at the second stage . Int. J. Prod. Res. , 29 : 1489
   Web of Science ®Google Scholar
• Kim , Y-D . 1990 . A comparison of dispatching rules for job shops with multiple identical jobs and alternative routings . Int. J. Prod. Res. , 28 : 953
   Web of Science ®Google Scholar
• Lee , G-C , Kim , Y-D and Choi , S-W . 2004 . Bottleneck-focused scheduling for a hybrid flowshop . Int. J. Prod. Res. , 42 : 165
   Web of Science ®Google Scholar
• Lee , G-C , Kim , Y-D , Kim , J-G and Choi , S-H . 2003 . A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system . J. Oper. Res. Soc. , 54 : 1038
   Web of Science ®Google Scholar
• Linn , R and Zhang , W . 1999 . Hybrid flow shop scheduling: a survey . Comput. Ind. Eng. , 37 : 57
   Web of Science ®Google Scholar
• Montgomery DC Design and Analysis of Experiments 5th Edn 2001 Wiley New York
   Google Scholar
• Moursli , O and Pochet , Y . 2000 . A branch-and-bound algorithm for the hybrid flowshop . Int. J. Prod. Econ. , 64 : 113
   Web of Science ®Google Scholar
• Nawaz , M , Enscore , EE and Ham , I . 1983 . A heuristic algorithm for the m-machine, n-job flow-shop scheduling problem . Omega , 11 : 91
   Web of Science ®Google Scholar
• Ovacik , IM and Uzsoy , R . 1994 . Exploiting shop floor status information to schedule complex job shops . J. Manuf. Sys. , 13 : 73
   Web of Science ®Google Scholar
• Pan , JC-H and Chen , J-S . 2003 . Minimizing makespan in re-entrant permutation flow-shops . J. Oper. Res. Soc. , 54 : 642
   Web of Science ®Google Scholar
• Panwalkar , SS and Iskander , W . 1977 . A survey of scheduling rules . Oper. Res. , 23 : 961
   Google Scholar
• Rajendran , C and Chaudhuri , D . 1992 . A multi-stage parallel-processor flowshop problem with minimum flowtime . Eur. J. Oper. Res. , 57 : 111
   Web of Science ®Google Scholar
• Ramasesh , R . 1990 . Dynamic job shop scheduling: a survey of simulation research . Omega , 18 : 43
   Web of Science ®Google Scholar
• Russell , RS , Dar-El , EM and Taylor , BS . 1987 . A comparative analysis of the COVERT job sequencing rule using various shop performance measures . Int. J. Prod. Res. , 25 : 1523
   Web of Science ®Google Scholar
• Vepsalainen , APJ and Morton , TE . 1987 . Priority rules for job shops with weighted tardiness costs . Manag. Sci. , 33 : 1035
   Web of Science ®Google Scholar
• Wang , MY , Sethi , SP and Van de Velde , SL . 1997 . Minimizing makespan in a class of reentrant shops . Oper. Res. , 45 : 702
   Web of Science ®Google Scholar