A Heuristic Method for Job Shop Scheduling Considering Alternative Machines

대안기계를 고려한 Job Shop Scheduling의 발견적 기법

This paper proposes a heuristic method for job shop scheduling with alternative machines. Our heuristic suggests two machine-selecting rules and two priority dispatching rules for modifying existent ones considering alternative machines, and then it extends existing nondelay/active job shop schedule generation. This heuristic provides good criteria(rules) in the selection of a proper machine among those performing a specific operation and for the dispatch of an operation to a selected machine and thus these rules permit the efficient job shop scheduling with alternative machines. The performances of our two machine-selecting rules in addition to the two priority dispatching rules, applied together with the existing 17 rules, are experimented and evaluated, respectively.