In this paper we consider the problem of scheduling n jobs such that makespan is minimized. It is assumed that the jobs can be divided into K job-classes and that the change-over time between two consecutive jobs depends on the job-classes to which the two jobs belong. In this setting, we discuss the one machine scheduling problem with arbitrary processing times and the parallel machines scheduling problem with identical processing times. In both cases it is assumed that the number of job-classes K is fixed. By using an appropriate integer programming formulation with a fixed number of variables and constraints, it is shown that these two problems are solvable in polynomial time. For the one machine scheduling case it is shown that the complexity of our algorithm is linear in the number of jobs n. Moreover, if the problem is encoded according to the high multiplicity model of Hochbaum and Shamir, the time complexity of the algorithm is shown to be a polynomial in log n. In the parallel machine scheduling case, it is shown that if the number of machines is fixed the same results hold. Copyright

dx.doi.org/10.1016/0305-0548(96)00016-0, hdl.handle.net/1765/59984
Computers & Operations Research
Erasmus School of Economics

van der Veen, J.A.A, & Zhang, J. (1996). Low-complexity algorithms for sequencing jobs with a fixed number of job-classes. Computers & Operations Research, 23(11), 1059–1067. doi:10.1016/0305-0548(96)00016-0