Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop

International Journal of Production Research

Volumn 43, Issue 11, 2005, Pages 2149-2167

  Choi, S W ^a   Kim, Y D ^a   Lee, G C ^b  

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

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Heuristics; Hybrid flowshop; Reentrant flows; Scheduling

Indexed keywords

COMPUTATION THEORY; HEURISTIC METHODS; SCHEDULING;

HYBRID FLOWSHOPS; PARALLEL MACHINES; SCHEDULING PROBLEMS;

PRODUCTION ENGINEERING;

EID: 27944484415     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540500050071     Document Type: Article

References (22)

1. Bertel, S. and Billaut, J.C., A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation. Eur. J. Oper. Res., 2004, 159, 651-662.
2. Brah, S.A., A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors. Prod. Plan. Contr., 1996, 7, 362-373.
3. Brah, S.A. and Loo, L.L., Heuristics for scheduling in a flow shop with multiple processors. Eur. J. Oper. Res., 1999, 113, 113-122.
4. Cheng, J., Karuno, Y. and Kise, H., A shifting bottleneck approach for a parallel-machine flowshop scheduling problem. J. Oper. Res. Soc. Japan, 2001, 44, 140-156.
5. Drobouchevitch, I.G. and Strusevich, V.A., A heuristic algorithm for two-machine re-entrant shop scheduling. Ann. Oper. Res., 1999, 86, 417-439.
6. Guinet, A.G.P. and Solomon, M.M., Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time. Int. J. Prod. Res., 1996, 34, 1643-1654.
7. Gupta, J.N.D. and Tunc, E.A., Schedules for a two stage hybrid flowshop with parallel machines at the second stage. Int. J. Prod. Res., 1991, 29, 1489-1502.
8. Kim, Y.-D., A comparison of dispatching rules for job shops with multiple identical jobs and alternative routings. Int. J. Prod. Res., 1990, 28, 953-962.
9. Lee, G.-C., Kim, Y.-D. and Choi, S.-W., Bottleneck-focused scheduling for a hybrid flowshop. Int. J. Prod. Res., 2004, 42, 165-181.
10. Lee, G.-C., Kim, Y.-D., Kim, J.-G. and Choi, S.-H., A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system. J. Oper. Res. Soc., 2003, 54, 1038-1049.
11. Linn, R. and Zhang, W., Hybrid flow shop scheduling: a survey. Comput. Ind. Eng., 1999, 37, 57-61.
12. Montgomery, D.C., Design and Analysis of Experiments, 5th Edn, 2001 (Wiley: New York).
13. Moursli, O. and Pochet, Y., A branch-and-bound algorithm for the hybrid flowshop. Int. J. Prod. Econ., 2000, 64, 113-125.
14. Nawaz, M., Enscore, E.E. and Ham, I., A heuristic algorithm for the m-machine, n-job flowshop scheduling problem. Omega, 1983, 11, 91-95.
15. Ovacik, I.M. and Uzsoy, R., Exploiting shop floor status information to schedule complex job shops. J. Manuf. Sys., 1994, 13, 73-84.
16. Pan, J.C.-H. and Chen, J.-S., Minimizing makespan in re-entrant permutation flow-shops. J. Oper. Res. Soc., 2003, 54, 642-653.
17. Panwalkar, S.S. and Iskander, W., A survey of scheduling rules. Oper. Res., 1977, 23, 961-973.
18. Rajendran, C. and Chaudhuri, D., A multi-stage parallel-processor flowshop problem with minimum flowtime. Eur. J. Oper. Res., 1992, 57, 111-112.
19. Ramasesh, R., Dynamic job shop scheduling: a survey of simulation research. Omega, 1990, 18, 43-57.
20. Russell, R.S., Dar-El, E.M. and Taylor, B.S., A comparative analysis of the COVERT job sequencing rule using various shop performance measures. Int. J. Prod. Res., 1987, 25, 1523-1540.
21. Vepsalainen, A.P.J. and Morton, T.E., Priority rules for job shops with weighted tardiness costs. Manag. Sci., 1987, 33, 1035-1047.
22. Wang, M.Y., Sethi, S.P. and Van de Velde, S.L., Minimizing makespan in a class of reentrant shops. Oper. Res., 1997, 45, 702-712.