A Genetic Algorithm for Scheduling Sequence-Dependant Jobs on Parallel Identical Machines

병렬의 동일기계에서 처리되는 순서의존적인 작업들의 스케쥴링을 위한 유전알고리즘

  • 이문규 (계명대학교 자동차공학부 산업공학) ;
  • 이승주 ((주)서린정보기술)
  • Published : 1999.09.30

Abstract

We consider the problem of scheduling n jobs with sequence-dependent processing times on a set of parallel-identical machines. The processing time of each job consists of a pure processing time and a sequence-dependent setup time. The objective is to maximize the total remaining machine available time which can be used for other tasks. For the problem, a hybrid genetic algorithm is proposed. The algorithm combines a genetic algorithm for global search and a heuristic for local optimization to improve the speed of evolution convergence. The genetic operators are developed such that parallel machines can be handled in an efficient and effective way. For local optimization, the adjacent pairwise interchange method is used. The proposed hybrid genetic algorithm is compared with two heuristics, the nearest setup time method and the maximum penalty method. Computational results for a series of randomly generated problems demonstrate that the proposed algorithm outperforms the two heuristics.

Keywords