Bicriteria scheduling in a two-machine permutation flowshop

References

• Ahmadi , RH and Bagchi , U . 1990 . Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop . European Journal of Operational Research , 44 : 331 – 336 .
   Web of Science ®Google Scholar
• Cheng , TCE , Lin , BMT and Toker , A . 2000 . Flowshop batching and scheduling to minimize the makespan . Naval Research Logistics , 47 : 128 – 144 .
   Web of Science ®Google Scholar
• Della Croce , F , Ghirardi , M and Tadei , R . 2002 . An improved branch-and-bound algorithm for the two machine total completion time flow shop problem . European Journal of Operational Research , 139 : 293 – 301 .
   Web of Science ®Google Scholar
• Della Croce , F , Narayan , V and Tadei , R . 1996 . The two-machine total completion time flow shop problem . European Journal of Operational Research , 90 : 227 – 237 .
   Web of Science ®Google Scholar
• Dudek , RA , Panwalkar , SS and Smith , ML . 1992 . The lessons of flowshop scheduling research . Operations Research , 40 : 7 – 13 .
   Web of Science ®Google Scholar
• Fisher , ML . 1981 . The Lagrangian relaxation method for solving integer programming problems . Management Science , 27 : 1 – 18 .
   Web of Science ®Google Scholar
• Fisher , ML . 1985 . An applications-oriented guide to Lagrangian relaxation . Interfaces , 15 : 10 – 21 .
   Web of Science ®Google Scholar
• Garey , MR and Johnson , DS . 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness , San Francisco, CA : Freedman .
   Google Scholar
• Garey , MR , Johnson , DS and Sethi , RR . 1976 . The complexity of flowshop and jobshop scheduling . Operations Research , 1 : 117 – 129 .
   Google Scholar
• Graham , RL , Lawler , EL , Lenstra , JK and Rinnoy Kan , AHG . 1979 . Optimization and approximation in deterministic sequencing and scheduling: a survey . Annals of Discrete Mathematics , 5 : 287 – 326 .
   Google Scholar
• Hoogeveen , H and Kawaguchi , T . 1999 . Minimizing total completion time in a two-machine flowshop: analysis of special cases . Mathematics of Operations Research , 24 : 887 – 913 .
   Web of Science ®Google Scholar
• Hoogeveen , JA and van de Velde , SL . 1995 . Stronger Lagrangian bounds by use of slack variables: application to machine scheduling problems . Mathematical Programming , 70 : 173 – 190 .
   Web of Science ®Google Scholar
• Ignall , E and Schrage , LE . 1965 . Application of the branch-and-bound technique to some flow-shop scheduling problems . Operations Research , 13 : 400 – 412 .
   Web of Science ®Google Scholar
• Johnson , SM . 1954 . Optimal two and three-stage production schedules with setup times included . Naval Research Logistics Quarterly , 1 : 61 – 68 .
   Google Scholar
• Lin , BMT and Wu , JM . 2005 . A simple lower bound for total completion time minimization in a two-machine flowshop . Asia–Pacific Journal of Operational Research , 22 : 391 – 408 .
   Web of Science ®Google Scholar
• Nagar , A , Haddock , J and Heragu , SS . 1995a . Multiple and bicriteria scheduling: a literature review . European Journal of Operational Research , 81 : 88 – 104 .
   Web of Science ®Google Scholar
• Nagar , A , Sunderesh , SH and Haddock , J . 1995b . A branch-and-bound approach for a two-machine flowshop scheduling problem . Journal of the Operational Research Society , 46 : 721 – 734 .
   Web of Science ®Google Scholar
• Reisman , A , Kumar , A and Motwani , J . 1997 . Flowshop scheduling/sequencing research: a statistical review of the literature, 1952–1994 . IEEE Transactions on Engineering Management , 44 : 316 – 329 .
   Web of Science ®Google Scholar
• van de Velde , SL . 1990 . Minimizing the sum of job completion times in the two-machine flow-shop by Lagrangean relaxation . Annals of Operations Research , 26 : 257 – 268 .
   Google Scholar
• Yeh , WC . 1999 . A new branch-and-bound approach for the n/2/flowshop/F + C max flowshop scheduling problem . Computers and Operations Research , 26 : 1293 – 1310 .
   Web of Science ®Google Scholar
• Yeh , WC . 2001 . An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem . Journal of Manufacturing Systems , 20 : 113 – 123 .
   Google Scholar