《2016 Job-shop scheduling with processing alternatives 》.pdf

European Journal of Operational Research 151 (2003) 307–332 /locate/dsw Job-shop scheduling with processing alternatives * Tamaas Kis Computer and Automation Research Institute, Hungarian Academy of Sciences, P.O. Box 63, H-1518 Budapest, Hungary Abstract In this paper we study an extension of the job-shop scheduling problem where the job routings are directed acyclic graphs that can model partial orders of operations and that contain sets of alternative subgraphs consisting of several operations each. We develop two heuristic algorithms for our problem: a tabu search and a genetic algorithm. The two heuristics are based on two common subroutines: one to insert a set of operations into a partial schedule and another to improve a schedule with fixed routing alternatives. The first subroutine relies on an efficient operation insertion technique and the second one is a generalisation of standard methods for classical job-shop scheduling. We compare our heuristics on various test problems, including the special case MPM job-shop scheduling. Moreover, we report on the success of the two subroutines on open-shop instances. 2003 Elsevier B.V. All rights reserved. Keywords: Scheduling; Job-shop; Open-shop; Insertion techniques; Tabu search; Genetic algorithms 1. Introduction (a) no machine can process more than one job (operation) at a time, Job-shop scheduling is one of the most basic (b) the processing of the operations cannot be in- models of scheduling theory (cf.