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

  • 제35권4호
  • /
  • Pages.257-265
  • /
  • 2009
  • /
  • 1225-0988(pISSN)
  • /
  • 2234-6457(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지

다 단계 혼합흐름공정 일정계획에서 납기지연 작업 수의 최소화를 위한 대체 목적함수 기반 탐색기법

Surrogate Objective based Search Heuristics to Minimize the Number of Tardy Jobs for Multi-Stage Hybrid Flow Shop Scheduling

  • 투고 : 2009.07.30
  • 심사 : 2009.11.11
  • 발행 : 2009.12.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

This paper considers the hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. In hybrid flow shops, each job is processed through multiple production stages in series, each of which has multiple identical parallel machines. The problem is to determine the allocation of jobs to the parallel machines at each stage as well as the sequence of the jobs assigned to each machine. Due to the complexity of the problem, we suggest search heuristics, tabu search and simulated annealing algorithms with a new method to generate neighborhood solutions. In particular, to evaluate and select neighborhood solutions, three surrogate objectives are additionally suggested because not much difference in the number of tardy jobs can be found among the neighborhoods. To test the performances of the surrogate objective based search heuristics, computational experiments were performed on a number of test instances and the results show that the surrogate objective based search heuristics were better than the original ones. Also, they gave the optimal solutions for most small-size test instances.

키워드

참고문헌

  1. Azizoglu, M., Cakmak, E. and Kondakci, S. A. (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. 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
  3. Chen, B. (1995), Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at on stage, Journal of Operation Research Society, 46, 231-244
  4. Choi, H.-S. and Lee, D.-H. (2007), A branch and bound algorithm for two-stage hybrid flow shops: minimizing the number of tardy jobs, Journal of the Korean Institute of Industrial Engineers, 33, 213-220
  5. Choi, H.-S., Kim, H.-W., Lee, D.-H., Yun, J., Yoon, C. Y., and Chae, K. B. (2009), Scheduling algorithms for two-stage reentrant hybrid flow shops: minimizing makespan under the maximum allowable due-dates, International Journal of Advanced Manufacturing Technology, 42, 963-973 https://doi.org/10.1007/s00170-008-1656-5
  6. Choi, H.-S. and Lee, D.-H. (2009), Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops, Computers and Industrial Engineering, 56, 113-120 https://doi.org/10.1016/j.cie.2008.04.005
  7. 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
  8. Garey, M. R. and Johnson, D. S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company
  9. Glover, F. (1989), Tabu search: part I, ORSA Journal of Computing, 1, 190-206 https://doi.org/10.1287/ijoc.1.3.190
  10. Glover, F., Laguna, M. (1993), Tabu search in Modern Heuristics Techniques for Combinatorial Problems, Blackwell Scientific Publications, Oxford, 70-141
  11. Guinet, A. G. P. and Solomon, M. M. (1996), Scheduling hybrid flow shops to minimize maximum tardiness or maximum completion time, International Journal of Production Research, 34, 1643-1654 https://doi.org/10.1080/00207549608904988
  12. Gupta, J. N. D. (1988), Two-stage hybrid flow shop scheduling problem, Journal of Operation Research Society, 39, 359-364 https://doi.org/10.1057/jors.1988.63
  13. 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
  14. 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
  15. 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
  16. Janiak, A., Kozan, E., Lichtenstein, M. and Oguz, C. (2007), Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion, International Journal of Production Economics, 105, 407-424 https://doi.org/10.1016/j.ijpe.2004.05.027
  17. Kemal, A., Orhan, E. and Alper, D. (2007), Using ant colony optimization to solve hybrid flow shop scheduling problems, International Journal of Advanced Manufacturing Technology, 35, 541-550 https://doi.org/10.1007/s00170-007-1048-2
  18. Kim, S.-I., Choi, H,-S. and Lee, D.-H. (2007), Scheduling algorithms for parallel machines with sequence-dependent setup and distinct ready times: minimizing total tardiness, Proceedings of the Institution of Mechanical Engineers Part B: Journal of Engineering Manufacture, 221, 1087-1096 https://doi.org/10.1243/09544054JEM779
  19. Laguna, M., Barnes, J. W. and Glover, F. (1991), Tabu search methods for a single machine scheduling problem, Journal of Intelligent Manufacturing, 2, 63-74 https://doi.org/10.1007/BF01471219
  20. 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
  21. Lee, G.-C. (2006), Scheduling methods for a hybrid flowshop with dynamic order arrival, Journal of the Korean Institute of Industrial Engineers, 32, 373-381
  22. Lee, G.-C. and Kim, Y.-D. (2004), A branch-and-bound 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
  23. 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
  24. 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
  25. 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
  26. Mourisli, O. and Pochet, Y. (2000), A branch-and-bound algorithm for the hybrid flow shop, International Journal of Production Research Economics, 64, 113-125 https://doi.org/10.1016/S0925-5273(99)00051-1
  27. Park, M.-W. and Kim, Y.-D. (1998), A systematic procedure for setting parameters in simulated annealing algorithms, Computers and Operations Research, 25, 207-217 https://doi.org/10.1016/S0305-0548(97)00054-3
  28. 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