Journal of Korean Institute of Industrial Engineers (대한산업공학회지)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지

A Branch and Bound Algorithm for Two-Stage Hybrid Flow Shop Scheduling : Minimizing the Number of Tardy Jobs

2단계 혼합흐름공정에서 납기 지연 작업수의 최소화를 위한 분지한계 알고리듬

  • Choi, Hyun-Seon (Department of Industrial Engineering, Hanyang University) ;
  • Lee, Dong-Ho (Department of Industrial Engineering, Hanyang University)
  • Published : 2007.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper considers a two-stage hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. Each job is processed through the two production stages in stages, each of which has multiple identical parallel machines. The problem is to determine the allocation and sequence of jobs at each stage. A branch and bound algorithm that gives the optimal solutions is suggested that incorporates the methods to obtain the lower and upper bounds. Dominance properties are also suggested to reduce the search space. To show the performance of the algorithm, computational experiments are done on randomly generated problems, and the results are reported.

Keywords

References

  1. Azizoglu, M., Cakmak, E., and Kondakci, S. (2001), A flexible flow shop problem with total flow time minimization, European Journal of Operational Research, 132, 528-538 https://doi.org/10.1016/S0377-2217(00)00142-9
  2. Azizoglu, M. and Kirca, O. (1998), Tardiness minimization on parallel machines, International Journal of Production Economics, 55, 163-168 https://doi.org/10.1016/S0925-5273(98)00034-6
  3. Brah, S. A. and Hunsucker, J. L. (1991), Branch and bound algorithm for the flow shop with multiple processors, European Journal of Operational Research, 51, 88-99 https://doi.org/10.1016/0377-2217(91)90148-O
  4. Chen, B. (1995), Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at on stage, Journal of the Operational Research Society, 46, 231-244
  5. Fouad, R., Abdelhakim, A. and Salah, E. E. (1998), A hybrid three-stage flowshop problem Efficient heuristics to minimize makespan, European Journal of Operational Research, 109, 321-329 https://doi.org/10.1016/S0377-2217(98)00060-5
  6. Garey, M. R. and Johnson, D. S. (1979), Computers and Intractability: A Guide to the Theory of NPCompleteness, W. H. Freeman and Company
  7. Guinet, A. G. P. and Solomon, M. M. (1996), ScheduJling hybrid flowshops to minimize maximum tardiness or maximum completion time, International Journal of Production Research, 34, 1643-1654 https://doi.org/10.1080/00207549608904988
  8. Gupta, J. N. D. (1988), Two-stage hybrid flow shop scheduling problem, Journal of the Operational Research Society, 39, 359-364 https://doi.org/10.1057/jors.1988.63
  9. Gupta, J. N. D. and Tunc, E. A. (1991), Scheduling for a two-stage hybrid flowshop with parallel machines at the second stage, International Journal of Production Research, 29, 1480-1502
  10. Gupta, J. N. D. and Tunc, E. A. (1998), Minimizing tardy jobs in a two-stage hybrid flowshop, International Journal of Production Research, 36, 2397-2417 https://doi.org/10.1080/002075498192599
  11. Ho, J. C. and Chang, Y-L. (1995), Minimizing the number of tardy jobs for m parallel machines, European Journal of Operational Research, 84, 343-355 https://doi.org/10.1016/0377-2217(93)E0280-B
  12. Huang, W. and Li, W. (1998), A two-stage hybrid flowshop with uniform machines and setup times, Mathematical and Computer Modelling, 27, 27-45
  13. Lee, C. Y. and Vairaktarakis, G. L. (1994), Minimizing makespan in hybrid flow shops, Operations Research Letters, 16, 149-158 https://doi.org/10.1016/0167-6377(94)90026-4
  14. Lee, G.-C. and Kim, Y-D. (2004), A branch-andbound algorithm for a two-stage hybrid flow shop scheduling problem minimizing total tardiness, International Journal of Production Research, 42, 4731-4743 https://doi.org/10.1080/0020754041233127044
  15. Lee, G.C, Kim, Y-D. and Choi, S.-W. (2004), Bottleneck-focused scheduling for a hybrid flow shop, International Journal of Production Research, 42, 165-181 https://doi.org/10.1080/00207540310001602892
  16. Lee, J.-S. and Park, S.-H. (1999), Scheduling heuristics for a two-stage hybrid flowshop with nonidentical parallel machines, Journal of the Korean Institute of Industrial Engineers, 25, 254-265
  17. Linn, R. and Zhang, W. (1999), Hybrid flow shop scheduling, Computers and Industrial Engineering, 37, 57-61 https://doi.org/10.1016/S0360-8352(99)00023-6
  18. Moore, J. M. (1968), An n-job, one-machine sequencing algorithm for minimizing the number of jobs, Management Science, 15, 102-109 https://doi.org/10.1287/mnsc.15.1.102
  19. Mourisli, O. and Pochet, Y (2000), A branch-andbound algorithm for the hybrid flow shop, International Journal of Production Economics, 64, 113-125 https://doi.org/10.1016/S0925-5273(99)00051-1
  20. Tsubone, H., Ohba, M. and Uetake, T. (1996), The impact of lot sizing and sequencing on manufacturing performance in a two-stage hybrid flow shop, International Journal of Production Research, 34, 3037-3053 https://doi.org/10.1080/00207549608905076