Minimizing makespan on an m-machine re-entrant flowshop

Computers and Operations Research

Volumn 35, Issue 5, 2008, Pages 1684-1696

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

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

Author keywords

Flowshop; Heuristics; Re entrant; Scheduling

Indexed keywords

HEURISTIC ALGORITHMS; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING; PRODUCTION ENGINEERING; SCHEDULING;

FLOWSHOP; M-MACHINE FLOWSHOP PROBLEMS; RE-ENTRANTS;

RESOURCE ALLOCATION;

EID: 34748813744     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.09.028     Document Type: Article

References (20)

1. Pan J.C., and Chen J.S. Minimizing makespan in re-entrant permutation flow-shops. Journal of the Operational Research Society 54 (2003) 642-653
2. Demirkol E., and Uzsoy R. Decomposition methods for reentrant flow shops with sequence dependent setup times. Journal of scheduling 3 (2000) 115-177
3. 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
4. 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
5. 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
6. 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) 2049-2067
7. 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
8. Choi S-W, Kim Y-D. Minimizing makespan on a two-machine re-entrant flowshop. Journal of the Operational Research Society, 2007, to appear.
9. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
10. Rajendran C., and Chaudhuri D. An efficient heuristic approach to the scheduling of jobs in a flowshop. European Journal of Operational Research 61 (1992) 318-325
11. Taillard E. Some efficient heuristic methods for flow-shop sequencing. European Journal of Operational Research 47 (1990) 65-74
12. Ahuja R.K., Ergun O., Rolin J.B., and Punnen A.P. A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics 123 (2002) 75-102
13. Osman I.H., and Potts C.N. Simulated annealing for permutation flow shop scheduling. OMEGA 17 (1989) 551-557
14. max flow-shop problem. Computers and Operations Research 17 (1990) 243-253
15. Ishubuchi M., Masaki S., and Tanaka H. Modified simulated annealing for the flow shop sequencing problems. European Journal of Operational Research 81 (1995) 388-398
16. Grabowski J., and Wodecki M. A very fast tabu search algorithm for the flow shop problem with makespan criterion. Computers and Operations Research 11 (2004) 1891-1909
17. Johnson D.S., Aragon C.R., Mcgeoch K.A., and Schevon C. Optimization by simulated annealing: an experimental evaluation; Part I, graph partitioning. Operations Research 37 (1989) 865-892
18. Gangadharan R., and Rajendran C. A simulated annealing heuristic for scheduling in a flowshop with bicriteria. Computers and Industrial Engineering 27 (1994) 473-476
19. Kim Y.-D., Lim H.-G., and Park M.-W. Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process. European Journal of Operational Research 91 (1996) 124-143
20. Montgomery D.C. Design and analysis of experiments (2000), Wiley, New York p. 100-3