A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness

References

• Azizoglu , M , Cakmak , E and Kondakci , S . 2001 . A flexible flowshop problem with total flow time minimization . Eur. J. Oper. Res. , 132 : 528 – 538 .
   Web of Science ®Google Scholar
• Azizoglu , M and Kirca , O . 1998 . Tardiness minimization on parallel machines . Int. J. Prod. Econ. , 55 : 163 – 168 .
   Web of Science ®Google Scholar
• Baker KR 1974 Introduction to Sequencing and Scheduling New York Wiley
   Google Scholar
• Brah SA 1988 Scheduling in a flow shop with multiple processors. Dissertation Abstracts International, 50, 1587B University Microfilms No. 89-122667
   Google Scholar
• Brah , SA and Hunsucker , JL . 1991 . Branch and bound algorithm for the flow shop with multiple processors . Eur. J. Oper. Res. , 51 : 88 – 99 .
   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 – 1654 .
   Web of Science ®Google Scholar
• Gupta , JND , Hariri , AMA and Potts , CN . 1997 . Scheduling a two-stage hybrid flow shop with parallel machines at the first stage . Ann. Oper. Res. , 69 : 171 – 191 .
   Web of Science ®Google Scholar
• Gupta , JND , Sexton , RS and Tunc , EA . 2000 . Selecting a scheduling heuristic through neural networks . INFORMS J. Comput. , 12 : 150 – 162 .
   Web of Science ®Google Scholar
• Gupta , JND and Tunc , EA . 1998 . Minimizing tardy jobs in a two-stage hybrid flowshop . Int. J. Prod. Res. , 36 : 2397 – 2417 .
   Web of Science ®Google Scholar
• Kim , Y-D . 1993 . A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops . Comput. Oper. Res. , 4 : 391 – 401 .
   Web of Science ®Google Scholar
• Kim , Y-D . 1995 . Minimizing total tardiness in permutation flowshops . Eur. J. Oper. Res., , 85 : 541 – 555 .
   Web of Science ®Google Scholar
• Koulamas , CP . 1994 . The total tardiness problem: review and extensions . Oper. Res. , 42 : 1025 – 1041 .
   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 – 181 .
   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 – 1049 .
   Web of Science ®Google Scholar
• Linn , R and Zhang , W . 1999 . Hybrid flow shop scheduling: a survey . Comput. Ind. Eng. , 37 : 57 – 61 .
   Web of Science ®Google Scholar
• Moursli , O and Pochet , Y . 2000 . A branch-and-bound algorithm for the hybrid flowshop . Int. J. Prod. Econ. , 64 : 113 – 125 .
   Web of Science ®Google Scholar
• Pan , JC-H , Chen , J-S and Chao , C-M . 2002 . Minimizing tardiness in a two-machine flow-shop . Comput. Oper. Res. , 29 : 869 – 885 .
   Web of Science ®Google Scholar
• Pan , JC-H and Fan , E-T . 1997 . Two-machine flowshop scheduling to minimize total tardiness . Int. J. Sys. Sci. , 28 : 405 – 414 .
   Web of Science ®Google Scholar
• Rajendran , C and Chaudhuri , D . 1992 . A multi-stage parallel-processor flowshop problem with minimum flowtime . Eur. J. Oper. Res. , 57 : 111 – 122 .
   Web of Science ®Google Scholar
• Sen , T , Dileepan , P and Gupta , JND . 1989 . The two-machine flowshop scheduling problem with total tardiness . Comput. Oper. Res. , 16 : 333 – 340 .
   Web of Science ®Google Scholar
• Sonmez , AI and Baykasoglu , A . 1998 . A new dynamic programming formulation of (n × m) flowshop sequencing problems with due dates . Int. J. Prod. Res. , 36 : 2269 – 2283 .
   Web of Science ®Google Scholar
• Yalaoui , F and Chu , C . 2002 . Parallel machine scheduling to minimize total tardiness . Int. J. Prod. Econ. , 76 : 265 – 279 .
   Web of Science ®Google Scholar