Minimizing makespan on a two-machine re-entrant flowshop

Journal of the Operational Research Society

Volumn 58, Issue 7, 2007, Pages 972-981

  Choi, S W ^a   Kim, Y D ^a  

^a 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 METHOD; COMPUTATIONAL EFFICIENCY; HEURISTIC ALGORITHMS; PROBLEM SOLVING; RANDOM PROCESSES;

BRANCH AND BOUND ALGORITHMS; COMPUTATIONAL EXPERIMENTS; RE-ENTRANT FLOWSHOPS;

SCHEDULING;

EID: 34249895292     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602220     Document Type: Article

References (18)

1. Allahverdi A (2003). The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime. Eur J Opl Res 147: 373-396.
2. Baker KR (1974). Introduction to Sequencing and Scheduling. John Wiley & Sons: New York.
3. Choi S-W, Kim Y-D and Lee G-C (2005). Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop. Int J Production Res 43: 2049-2067.
4. Demirkol E and Uzsoy R (2000). Decomposition methods for reentrant flow shops with sequence dependent setup times. J Scheduling 3: 115-177.
5. Drobouchevitch IG and Strusevich VA (1999). A heuristic algorithm for two-machine re-entrant shop scheduling. Ann Opns Res 86: 417-439.
6. Graves SC, Meal HC, Stefek D and Zeghmi AH (1983). Scheduling of re-entrant flow shops. J Opns Mngt 3: 197-207.
7. Hwang H and Sun JU (1997). Production sequencing problem with reentrant work flows and sequence dependent setup times. Comput Indust Eng 33: 773-776.
8. Johnson SM (1954). Optimal two- and three-stage production schedules with setup times included. Naval Res Logistics Q 1: 61-68.
9. Kim Y-D (1993). Heuristics for flowshop scheduling problems minimizing mean tardiness. J Opl Res Soc 44: 19-28.
10. Ko HH, Baek JK, Kang YH and Kim SS (2004). A scheduling scheme for restricted parallel machines cycling process. J Korean Inst Indust Eng 30: 107-119.
11. Kubiak W, Lou SXC and Wang Y (1996). Mean flow time minimization in reentrant job shops with a hub. Opns Res 44: 764-776.
12. Nawaz M, Enscore EE and Ham I (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11: 91-95.
13. Palmer DS (1965). Sequencing jobs through a multi-stage process in the minimum total time - a quick method of obtaining a near optimum. Opl Res Q 16: 101-107.
14. Pan JC and Chen JS (2003). Minimizing makespan in re-entrant permutation flow-shops. J Opl Res Soc 54: 642-653.
15. Pan JC and Chen JS (2005). Mixed binary integer programming formulations for the reentrant job shop scheduling problem. Comput Opns Res 32: 1197-1212.
16. Pearn WL, Chung SH, Chen AY and Yang MH (2004). A case study on the multistage IC final testing scheduling problem with reentry. Int J Product Econom 88: 257-267.
17. Tadei R, Gupta JND, Della Croce F and Cortesi M (1998). Minimizing makespan in the two-machine flow-shop with release times. J Opl Res Soc 49: 77-85.
18. Wang MY, Sethi SP and Van De Velde SL (1997). Minimizing makespan in a class of reentrant shops. Opns Res 45: 702-712.