Heuristic algorithms for re-entrant hybrid flow shop scheduling with unrelated parallel machines

Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture

Volumn 223, Issue 4, 2009, Pages 433-442

  Kim, H W ^a   Lee, D H ^a  

^a Hanyang University   (South Korea)

Author keywords

Heuristics; Hybrid flow shops; Re entrant flows; Scheduling; Unrelated parallel machines

Indexed keywords

BI-CRITERIA; COMPUTATION TIME; CONSTRAINT SET; DUE DATES; HEURISTICS; HYBRID FLOW SHOP; HYBRID FLOW SHOP SCHEDULING; HYBRID FLOW SHOPS; MINIMIZING MAKESPAN; PARALLEL MACHINE; PROCESSING TIME; RE-ENTRANT FLOWS; SCHEDULING PROBLEM; SEARCH HEURISTIC; SERIAL PRODUCTION; SINGLE OBJECTIVE; TOTAL TARDINESS; UNRELATED PARALLEL MACHINES;

HEURISTIC METHODS; INDUSTRIAL RESEARCH; MACHINE SHOP PRACTICE; PARALLEL ALGORITHMS; PORTALS;

HEURISTIC ALGORITHMS;

EID: 67651174349     PISSN: 09544054     EISSN: None     Source Type: Journal    
DOI: 10.1243/09544054JEM1318     Document Type: Article

References (29)

1. Gupta, J. N. D. Two-stage hybrid flow shop scheduling problem. J. Opl Res. Soc., 1988, 39, 359-364.
2. Linn, R. and Zhang, W. Hybrid flow shop scheduling. Computers Ind. Engng, 1999, 37, 57-61.
3. Lee, G.-C. and Kim, Y.-D. A branch-and-bound algorithm for a two-stage hybrid flow shop scheduling problem minimizing total tardiness. Int. J. Prod. Res., 2004, 42, 4731-4743.
4. Choi, H.-S., Kim, H.-W., Lee, D.-H., Yoon, J.-G., Yun, C.-Y., and Chae, K.-B. Scheduling algorithms for two-stage reentrant hybrid flow shops: minimizing makespan under the maximum allowable due dates. Int. J. Advd Mfg Technol., available online 30 July 2008.
5. Tsubone, H., Ohba, M., and Uetake, T. The impact of lot sizing and sequencing on manufacturing performance in a two-stage hybrid flow shop. Int. J. Prod. Res., 1996, 34, 3037-3053.
6. Lian, Y., Shis, H. M., Pfund, M., Carlyle, W. M., and Fowler, J. W. Scheduling of unrelated parallel machines: an application to PWB manufacturing. IIE Trans., 2002, 34, 921-931.
7. Gupta, J. N. D. and Tunc, E. A. Scheduling for a two-stage hybrid flow shop with parallel machines at the second stage. Int. J. Prod. Res., 1991, 36, 2397-2417.
8. Lee, C. Y. and Vairaktarakis, G. L. Minimizing make-span in hybrid flow shops. Ops Res. Lett., 1994, 16, 149-158.
9. Choi, H.-S. and Lee, D.-H. A branch and bound algorithm for two-stage hybrid flow shops: minimizing the number of tardy jobs. J. Korean Inst. Ind. Engrs, 2007, 33, 213-220.
10. Choi, H.-S. and Lee, D.-H. Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops. Computers Ind. Engng, 2009, 56, 113-120.
11. Bertel, S. and Billaut, J. C. A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation. Eur. J. Opl Res., 2004, 159(3), 651-662.
12. Choi, S.-W., Kim, Y.-D., and Lee, G.-C. Minimizing total tardiness of orders with re-entrant lots in a hybrid flowshop. Int. J. Prod. Res., 2005, 43, 2149-2167.
13. Wein, L. M. Scheduling semiconductor wafer fabrication. IEEE Trans. Semiconductor Mfg, 1988, 1, 115-130.
14. Glassey, C. R. and Resende, M. C. G. A scheduling rule for job release in semiconductor fabrication. Ops Res. Lett., 1988, 7(5), 213-217.
15. Kim, Y.-D., Lee, D.-H., Kim, J.-U., and Roh, H.-K. A simulation study on lot release control, dispatching and batch scheduling in semiconductor wafer fabrication facilities. J. Mfg Systems, 1998, 17, 107-117.
16. Gupta, J. N. D., Ruiz, R., Fowler, J. W., and Mason, S. J. Operational planning and control of semiconductor wafer production. Prod. Planning Control, 2006, 17, 639-647.
17. Tsubone, H., Ohba, M., and Uetake, T. The impact of lot sizing and sequencing on manufacturing performance in a two-stage hybrid flow shop. Int. J. Prod. Res., 1996, 34, 3037-3053.
18. Gupta, J. N. D. and Tunc, E. A. Minimizing tardy jobs in a two-stage hybrid flowshop. Int. J. Prod. Res., 1998, 36, 2397-2417.
19. Gupta, J. N. D., Kruger, K., Lauff, V., Werner, F., and Sotskov, Y. N. Heuristics for hybrid flow shops with controllable processing times and assignable due dates. Computers Ops Res., 2002, 29, 1417-1439.
20. Lee, G.-C., Kim, Y.-D., and Choi, S.-W. Bottleneck-focused scheduling for a hybrid flow shop. Int. J. Prod. Res., 2004, 42, 165-181.
21. Suresh, V. A note on scheduling of two-stage flow shop with multiple processors. Int. J. Prod. Econ., 1997, 49, 77-82.
22. Lee, J.-S. and Park, S.-H. Scheduling heuristics for a two-stage hybrid flowshop with nonidentical parallel machines. J. Korean Inst. Ind. Engrs, 1999, 25, 254-265.
23. Low, C. Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. Computers Ops Res., 2005, 32, 2013-2025.
24. Jungwattanakit, J., Reodecha, M., Chaovalitwongse, P., and Werner, F. A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Computers Ops Res., 2009, 36(2), 358-378.
25. Jungwattanakit, J., Reodecha, M., Chaovalitwongse, P., and Werner, F. Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Int. J. Advd Mfg Technol., 2008, 37, 354-370.
26. Pan, J. C. H. and Chen, J. S. Mixed binary integer programming formulations for the re-entrant job shop scheduling problem. Computers Ops Res., 2005, 32, 1197-1212.
27. Wang, M. Y., Sethi, S. P., and Van de velde, S. L. Minimizing makespan in a class of re-entrant shops. Ops Res., 1997, 45, 702-712.
28. Campbell, H. G., Dudek, R. A., and Smith, M. L. A heuristic algorithm for the n job m machine sequencing problem. Mgmt Sci., 1970, 16, 630-637.
29. Nawaz, M., Enscore, E., and Ham, I. A heuristic algorithm for the m machine, n job flow shop sequence problem. Omega, 1983, 11, 91-95.