Minimizing the number of machines for scheduling jobs with equal processing times
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.
Year of publication: |
2009
|
---|---|
Authors: | Kravchenko, Svetlana A. ; Werner, Frank |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 199.2009, 2, p. 595-600
|
Publisher: |
Elsevier |
Subject: | Parallel machine scheduling Linear programming |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Minimizing the number of machines for scheduling jobs with equal processing times
KravĨenko, Svetlana A., (2009)
-
Preemptive scheduling on uniform machines to minimize mean flow time
KravĨenko, Svetlana A., (2009)
-
Minimizing total tardiness on parallel machines with preemptions
Kravchenko, Svetlana A., (2012)
- More ...