Job-shop scheduling with multi-purpose machines

Abstract

Consider the following generalization of the classical job-shop scheduling problem in which a set of machines is associated with each operation of a job. The operation can be processed on any of the machines in this set. For each assignment μ of operations to machines let P(μ) be the corresponding job-shop problem and f(μ) be the minimum makespan of P(μ). How to find an assignment which minimizes f(μ)? For problems with two jobs a polynomial algorithm is derived. © 1990 Springer-Verlag.