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

• 영문명: An Improved Genetic Algorithm to Minimize Makespan in Flowshop with Availability Constraints
• 발행기관: 한국산업경영시스템학회
• 저자명: 이경화(Kyung-Hwa Lee) 정인재(In-Jae Jeong)
• 간행물 정보: 『산업경영시스템학회지』제30권 제1호, 115~121쪽, 전체 7쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2007.03.30

영문 초록

  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. 서론
2. 문제 정의
3. 제안하는 유전 알고리듬
4. 실험결과
5. 결론
참고문헌

키워드

Flowshop scheduling Machine availability Schedule generator