07-25
Minimizing the Number of Machines in a Unit-Time Scheduling Problem
by Kravchenko, S.A.; Werner, F.
Preprint series: 07-25, Preprints
The paper is published: European Journal of Operational Research, Vol. 199, No. 2, 2009, 595 - 600.
Abstract: In this paper, we give a polynomial algorithm for the problem of minimizing the number of machines in a parallel machine environment with equal processing times of all jobs and arbitrarily given release dates and de adlines.
Keywords: Parallel Machine Scheduling, Linear Programming
The author(s) agree, that this abstract may be stored asfull text and distributed as such by abstracting services.