A Heuristic for parallel Machine Scheduling Depending on Job Characteristics

작업의 특성에 종속되는 병렬기계의 일정계획을 위한 발견적 기법

  • 이동현 (부산대학교 산업공학과) ;
  • 이경근 (부산대학교 산업공학과) ;
  • 김재균 (울산대학교 산업공학부) ;
  • 박창권 (울산대학교 산업공학부) ;
  • 장길상 (동국대학교 상경대학 정보산업학과)
  • Published : 1992.04.01

Abstract

In the real world situations that some jobs need be processed only on certain limited machines frequently occur due to the capacity restrictions of machines such as tools fixtures or material handling equipment. In this paper we consider n-job non-preemptive and m parallel machines scheduling problem having two machines group. The objective function is to minimize the sum of earliness and tardiness with different release times and due dates. The problem is formulated as a mixed integer programming problem. The problem is proved to be Np-complete. Thus a heuristic is developed to solve this problem. To illustrate its suitability and efficiency a proposed heuristic is compared with a genetic algorithm and tabu search for a large number of randomly generated test problems in ship engine assembly shop. Through the experimental results it is showed that the proposed algorithm yields good solutions efficiently.

Keywords