Journal article

Scheduling two parallel machines with a single server: the general case

AH Abdekhodaee, A Wirth, HS Gan

COMPUTERS & OPERATIONS RESEARCH | PERGAMON-ELSEVIER SCIENCE LTD | Published : 2006

Abstract

This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semi-automatic machines. A single server is available to carry out the first (or setup) operation. The second operation is executed automatically, without the server. The general problem of makespan minimization is NP-hard in the strong sense. In earlier work, we showed that the equal total length problem is polynomial time and we also provided efficient and effective solutions for the special cases of equal setup and equal processing times. Most of the cases analyzed thus far have fallen into the category of regular problems. In this paper we build on this earlier work to deal with the general..

View full abstract