Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지

Branch and Bound Algorithm for Two-Machine Reentrant Flowshop with the Objective of Minimizing Total Flowtime

재투입이 존재하는 2단계 흐름공정에서 총 작업 흐름시간을 최소화하는 분지한계방법

  • Choi, Seong-Woo (Department of Business Administration, Kyonggi University) ;
  • Shim, Sang-Oh (Department of Business Administration, Hanbat National University)
  • Received : 2010.05.06
  • Accepted : 2010.07.25
  • Published : 2010.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we consider a two-machine re-entrant permutation flowshop scheduling problem with the objective of minimizing total flowtime, and suggest branch and bound algorithms for the scheduling problem. In this scheduling problem, each job must be processed twice on each machine, that is, each job should be processed on the two machines in the order of machine 1, machine 2 and then machine 1 and machine 2. In this research, based on the results of existing researches for re-entrant permutation flowshop scheduling problems, various dominance properties, lower bound and heuristic algorithm are suggested for the problem, and those are used to develop branch and bound algorithms. In the computational experiments for evaluation of the performance of the algorithms, the suggested branch and bound algorithms are tested on randomly generated test problems and results are reported.

Keywords

References

  1. Baker, K. R.; Introduction to Sequencing and Scheduling. John Wiley and Sons: New York, 148-152, 1974.
  2. Choi, S.-W. and Kim, Y.-D.; "Minimizing makespan on a two-machine re-entrant flowshop," Journal of the Operational Research Society, 58(7) : 972-981, 2007. https://doi.org/10.1057/palgrave.jors.2602220
  3. Choi, S.-W. and Kim, Y.-D.; "Minimizing makespan on an m-machine re-entrant flowshop," Computers and Operations Research, 35(5) : 1684-1696, 2008. https://doi.org/10.1016/j.cor.2006.09.028
  4. Choi, S.-W. and Kim, Y.-D.; "Minimizing total tardiness on a two-machine re-entrant flowshop," Journal of the Operational Research Society, 199(2) : 375-384, 2009. https://doi.org/10.1016/j.ejor.2008.11.037
  5. Della Croce, F., Narayan, V., and Tadei, R.; "The two-machine total completion time flow shop problem," European Journal of Operational Research, 90(2) : 227-237, 1996. https://doi.org/10.1016/0377-2217(95)00351-7
  6. Demirkol, E. and Uzsoy, R.; "Decomposition methods for reentrant flow shops with sequence dependent setup times," Journal of Scheduling, 3(3) : 115-177, 2000.
  7. Graves, S. C., Meal, H. C., Stefek, D., and Zeghmi, A. H.; "Scheduling of re-entrant flow shops," Journal of Operations Management, 3(4) : 197-207, 1983. https://doi.org/10.1016/0272-6963(83)90004-9
  8. Hoogeveen, J. A. and van de Velde, S. L.; "Stronger Lagrangean bounds by use of slack variables : Application to machine scheduling problems," Mathematical Programming, 70(1-3) : 173-190, 1995. https://doi.org/10.1007/BF01585935
  9. Ignall, E. and Schrage, L. E.; "Application of the branchandbound technique to some flow shop problems," Operations Research, 13(3) : 400-412, 1965. https://doi.org/10.1287/opre.13.3.400
  10. Kim, Y.-D.; "A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops", Computers and Opteration Reasearch, 20(4) :391-401, 1993. https://doi.org/10.1016/0305-0548(93)90083-U
  11. Nawaz, M., Enscore, E. E., and Ham, I.; "A heuristic algorithm for the m-machine, n-job flow-shop scheduling problem," Omega, 11(1) : 91-95, 1983. https://doi.org/10.1016/0305-0483(83)90088-9
  12. Pan, J. C. H. and Chen, J. S.; "Minimizing makespan in re-entrant permutation flow-shops," Journal of Operational Research Society, 54(6) : 642-653, 2003. https://doi.org/10.1057/palgrave.jors.2601556
  13. van de Velde, S. L.; "Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangean relaxation," Annals of Operations Research, 26(1) : 257-268, 1990.