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

초록

In this paper, we study flowshop scheduling problems with availability constraints. In such problems, jobs have to be scheduled on 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.

키워드