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

  • 제30권1호
  • /
  • Pages.115-121
  • /
  • 2007
  • /
  • 2005-0461(pISSN)
  • /
  • 2287-7975(eISSN)
한국산업경영시스템학회 (Society of Korea Industrial and System Engineering)
권호 표지

기계 가용성 제약을 고려한 흐름공정 상황하에서 Makespan을 최소화하기 위한 향상된 유전 알고리듬

An Improved Genetic Algorithm to Minimize Makespan in Flowshop with Availability Constraints

  • Lee, Kyung-Hwa (Department of Industrial Engineering, Hanyang University) ;
  • Jeong, In-Jae (Department of Industrial Engineering, Hanyang University)
  • 발행 : 2007.03.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper, we study flowshop scheduling problems with availability constraints. In such problems, n jobs have to be scheduled on m machines sequentially under assumption that the machines are unavailable during some periods of planning horizon. The objective of the problem is to find a non-permutation schedule which minimizes the makespan. As a solution procedure, we propose an improved genetic algorithm which utilizes a look-ahead schedule generator to find good solutions in a reasonable time Computational experiments show that the proposed genetic algorithm outperforms the existing genetic algorithm.

키워드

참고문헌

  1. 김여근, 윤복식, 이상복; '메타휴리스틱 : 유전 알고리듬.시뮬레이티드 어닐링.타부서치', 영지문화사, 1999
  2. Adiri, I., Bruno, J., Frostig, E., and Rinnooy Kan, A. H. G.; 'Single machine flow-time scheduling with a single breakdown,' Acta Informatica, 26 : 679-696, 1989 https://doi.org/10.1007/BF00288977
  3. Aggoune, R.; 'Minimizing the makespan for the flow shop scheduling problem with availability constraints,' European Journal of Operational Research, 153 : 534-543, 2004 https://doi.org/10.1016/S0377-2217(03)00261-3
  4. Blazewicz, J., Breit, J., Formanowicz, P., Kubiak, W., Schmidt, G.; 'Heuristic algorithms for the two-machine flowshop problem with limited machine availability,' Omega Journal, 29 : 599-608, 2001 https://doi.org/10.1016/S0305-0483(01)00048-2
  5. Blazewicz, J., Formanowicz, P., Kubiak, W., Przysuch, M. Schmidt, G.; 'Parallel branch and bound algorithms for the two-machine flow shop problem with limited machine availability,' Bulletin of the Polish Academy of Sciences, Technical Sciences, 2000
  6. Gen, M. and Cheng, R.; Genetic Algorithms and engineering design, A Wiley Interscience Publication, 1997
  7. Holland, J.; Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975
  8. Kubiak, W., Blazewicz, J., Formanowicz, P., and Breit, J., Schmidt, G.; 'Two-machine flow shops with limited machine availability,' European Journal of Operational Research, 136 : 528-540., 2002
  9. Lee, C.-Y.; 'Parallel machines scheduling with non-simultaneous machine available time,' Discrete Applied Mathematics, 30 : 53-61, 1991 https://doi.org/10.1016/0166-218X(91)90013-M
  10. Lee, C.-Y., Liman, S. D.; 'Capacitated two-parallel machines scheduling to minimize sum of job completion times,' Discrete Applied Mathematics, 41 : 211-222, 1993 https://doi.org/10.1016/0166-218X(90)90055-H
  11. Lee, C.-Y.; 'Machine scheduling with an availability constraint,' Journal of Global Optimization, 9 : 395-416, 1995 https://doi.org/10.1007/BF00121681
  12. Lee, C.-Y.; 'Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint,' Operations Research Letters, 20 : 129-139, 1997 https://doi.org/10.1016/S0167-6377(96)00041-7
  13. Lee, C.-Y.; 'Two-machine flowshop scheduling with availability constraints,' European Journal of Operational Research, 114 : 420-429, 1999 https://doi.org/10.1016/S0377-2217(97)00452-9
  14. Schmidt, G.; 'Scheduling on semi-identical processors,' Zeitschrift fur Operations Research, 28 : 153-162, 1984 https://doi.org/10.1007/BF01920917