| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 481328 | European Journal of Operational Research | 2009 | 4 Pages |
Abstract
In this paper, we present a new objective function for scheduling on parallel machines: minimizing the number of machines for schedules of minimum length. We study its complexity and we prove the NP-completeness of this problem, even if there is no precedences or for unitary execution times. We propose several polynomial algorithms for various particular cases.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Gerd Finke, Pierre Lemaire, Jean-Marie Proth, Maurice Queyranne,