Minimizing total tardiness on a two-machine re-entrant flowshop

European Journal of Operational Research

Volumn 199, Issue 2, 2009, Pages 375-384

  Choi, Seong Woo ^a   Kim, Yeong Dae ^b  

^a Hoseo University   (South Korea)

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

Author keywords

Branch and bound; Heuristics; Re entrant flowshop; Scheduling

Indexed keywords

BRANCH AND BOUND; BRANCH-AND-BOUND ALGORITHMS; COMPUTATIONAL EXPERIMENTS; CPU TIME; DOMINANCE PROPERTIES; FLOW-SHOP SCHEDULING PROBLEMS; HEURISTIC SOLUTIONS; HEURISTICS; LOWER BOUNDS; ON-MACHINES; RE-ENTRANT FLOWSHOP; TEST PROBLEMS; TOTAL TARDINESS; TWO MACHINES;

CONTROL THEORY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; LINEAR PROGRAMMING; SCHEDULING ALGORITHMS;

PROBLEM SOLVING;

EID: 67349128578     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.11.037     Document Type: Article

References (29)

1. Baker K.R. Introduction to Sequencing and Scheduling (1974), John Wiley & Sons, New York
2. Choi S.-W., and Kim Y.-D. Minimizing makespan on a two-machine re-entrant flowshop. Journal of the Operational Research Society 58 (2007) 972-981
3. Choi S.-W., and Kim Y.-D. Minimizing makespan on an m-machine re-entrant flowshop. Computers and Operations Research 35 (2008) 1684-1696
4. Choi, S.-W., Kim, Y.-D., 2008b. Proofs of propositions for a two-machine re-entrant flowshop scheduling problem. Technical Report 2008-07, Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, Yusong-gu, Daejon, Korea.
5. Choi S.-W., Kim Y.-D., and Lee G.-C. Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop. International Journal of Production Research 43 (2005) 2149-2167
6. Demirkol E., and Uzsoy R. Decomposition methods for reentrant flow shops with sequence dependent setup times. Journal of Scheduling 3 (2000) 115-177
7. Drobouchevitch I.G., and Strusevich V.A. A heuristic algorithm for two-machine re-entrant shop scheduling. Annals of Operations Research 86 (1999) 417-439
8. Gelders L.F., and Sambandam N. Four simple heuristics for scheduling a flow-shop. International Journal of Production Research 16 (1978) 221-231
9. Graves S.C., Meal H.C., Stefek D., and Zeghmi A.H. Scheduling of re-entrant flow shops. Journal of Operations Management 3 (1983) 197-207
10. Hwang H., and Sun J.U. Production sequencing problem with reentrant work flows and sequence dependent setup times. Computers and Industrial Engineering 33 (1997) 773-776
11. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 (1954) 61-68
12. Kim Y.-D. A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops. Computers and Operations Research 20 (1993) 391-401
13. Kim Y.-D. Heuristics for flowshop scheduling problems minimizing mean tardiness. Journal of Operational Research Society 44 (1993) 19-28
14. Kim Y.-D. Minimizing total tardiness in permutation flowshops. European Journal of Operational Research 85 (1995) 541-555
15. Ko H.H., Baek J.K., Kang Y.H., and Kim S.S. A scheduling scheme for restricted parallel machines cycling process. Journal of the Korean Institute of Industrial Engineers 30 (2004) 107-119
16. Koulamas C. The total tardiness problem: Review and extensions. Operations Research 42 (1994) 1025-1041
17. Kubiak W., Lou S.X.C., and Wang Y. Mean flow time minimization in reentrant job shops with a hub. Operations Research 44 (1996) 764-776
18. Nawaz M., Enscore E.E., and Ham I. A heuristic algorithm for the m-machine, n-job flow-shop scheduling problem. Omega 11 (1983) 91-95
19. Ow P.S. Focused scheduling in proportionate flowshops. International Journal of Production Research 31 (1985) 852-869
20. Pan J.C., and Chen J.S. Minimizing tardiness in a two-machine flow-shop. Computers and Operations Research 29 (2002) 869-885
21. Pan J.C.H., and Chen J.S. Minimizing makespan in re-entrant permutation flow-shops. Journal of Operational Research Society 54 (2003) 642-653
22. Pan J.C.H., and Chen J.S. Mixed binary integer programming formulations for the reentrant job shop scheduling problem. Computers and Operations Research 32 (2005) 1197-1212
23. Pan J.C.H., and Fan E.T. Two-machine flow-shop scheduling to minimize total tardiness. International Journal of Systems Science 28 (1997) 405-414
24. Pearn W.L., Chung S.H., Chen A.Y., and Yang M.H. A case study on the multistage IC final testing scheduling problem with reentry. International Journal of Production Economics 88 (2004) 257-267
25. Schaller J. Note on minimizing total tardiness in a two-machine flowshop. Computers and Operations Research 32 (2005) 3273-3281
26. Sen T., Dileepan P., and Gupta J.N.D. The two-machine flowshop scheduling problem with total tardiness. Computers and Operations Research 16 (1989) 333-340
27. Townsend W. Sequencing n jobs on m machines to minimize maximum tardiness: A branch-and-bound solution. Management Science 23 (1977) 1016-1019
28. Wang M.Y., Sethi S.P., and Van De Velde S.L. Minimizing makespan in a class of reentrant shops. Operations Research 45 (1997) 702-712
29. Yang D.-L., Kuo W.-H., and Chern M.-S. Multi-family scheduling in a two-machine reentrant flow shop with setups. European Journal of Operational Research 187 (2008) 1160-1170