| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 477168 | European Journal of Operational Research | 2009 | 6 Pages |
Abstract
In this paper, we consider a parallel machine environment when all jobs have the same processing time and arbitrary release dates and deadlines of the jobs are given. We suppose that the available number of machines, which can be used simultaneously, may vary over time. The aim is to construct a feasible schedule in such a way that the maximal number of simultaneously used machines is minimal. We give a polynomial algorithm for this problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Svetlana A. Kravchenko, Frank Werner,