효과적인 디스패칭 방식을 이용한 병렬기계의 일정계획 문제에 대한 유전알고리즘

This paper considers a non-identical parallel machine scheduling problem with ready times, due times and sequence and machine-dependent setup times. The objective of this problem is to determine the allocation of jobs and the scheduling of machines to minimize the weighted sum of setup times, delay times and tardy times. A mathematical model for the optimal solution is derived and a genetic algorithm using an effective dispatching method (GA_DR). The erformance of the proposed GA algorithm is evaluated through compare with the optimal solutions and the conventional one-dimensional GA with special character (GA_SC) for machine separations using randomly generated several examples.