Minimizing the Number of Machines in a Unit-Time Scheduling Problem

by    S.A. Kravchenko, F. Werner

Preprint series: 07-25 , Preprints

MSC:
90B35 Scheduling theory, See also {68M20}

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

Upload: 2007-08-24-08-24


The author(s) agree, that this abstract may be stored as full text and distributed as such by abstracting services.