Title of article
Minimizing the number of machines for minimum length schedules
Author/Authors
Gerd Finke، نويسنده , , Pierre Lemaire، نويسنده , , Jean-Marie Proth، نويسنده , , Maurice Queyranne ، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
4
From page
702
To page
705
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
Parallel scheduling , Complexity , Minimum number of processors
Journal title
European Journal of Operational Research
Serial Year
2009
Journal title
European Journal of Operational Research
Record number
1314042
Link To Document