Bicriteria scheduling in a two-machine permutation flowshop

International Journal of Production Research

Volumn 44, Issue 12, 2006, Pages 2299-2312

  Lin, B M T ^a   Wu, J M ^b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b NATIONAL CHI NAN UNIVERSITY   (China)

Author keywords

Branch and bound algorithm; Flowshop; Lower bound; Makespan; Total completion time

Indexed keywords

EID: 85015929648     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540500446394     Document Type: Article

References (21)

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