by Kravchenko, S.A., Werner, F..
Series: 1998-30, Preprints
In this paper, we consider the problem of scheduling a set of jobs on a set of identical parallel machines.
Before the processing of a job can start, a setup is required which has to be performed by one server of a given set of available servers.
We consider the complexity of such problems for the minimization of makespan. For the problem with unit setup times, m machines and m-1 servers, we give a pseudopolynomial algorithm. However, the problem with
fixed number of machines and servers in the case of minimizing maximum lateness is proven to be unary NP-hard. Moreover, we perform a worst-case analysis of two list scheduling algorithms for makespan minimization.
Parallel machine scheduling, setup times, NP-hard problems, pseudopolynomial algorithm, flexible manufacturing