ALCOMFT-TR-03-58

Csanad Imreh
Scheduling problems on two sets of identical machines
MPI. Work package 4. October 2003.

Abstract: In this paper we investigate the following scheduling problem: We have two sets of identical machines, the jobs have two processing times one for each set of machines. We consider two different objective functions, in the first model the goal is to minimize the maximum of the makespans on the sets, in the second model we minimize the sum of the makespans. We consider the online, semi online and offline versions of these problems.

Postscript file: ALCOMFT-TR-03-58.ps.gz (111 kb).