이종 병렬설비 공정의 작업완료시간 최소화를 위한 유전 알고리즘

This paper considers a parallel-machine scheduling problem with dedicated and common processing machines. Non-identical setup and processing times are assumed for each machine. A genetic algorithm is proposed to minimize the makespan objective measure. In this paper, a lowerbound and some heuristic algorithms are derived and tested through computational experiments.