Minimizing the number of machines for minimum length schedules - Optimisation des systèmes de Production
Journal Articles European Journal of Operational Research Year : 2009

Minimizing the number of machines for minimum length schedules

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.
Fichier principal
Vignette du fichier
flpq.pdf (125.07 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00361039 , version 1 (10-10-2022)

Identifiers

Cite

Gerd Finke, Pierre Lemaire, Jean-Marie Proth, Maurice Queyranne. Minimizing the number of machines for minimum length schedules. European Journal of Operational Research, 2009, 199 (3), pp.702-705. ⟨10.1016/j.ejor.2006.11.050⟩. ⟨hal-00361039⟩
177 View
234 Download

Altmetric

Share

More