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.

MoreLess

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

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://ebvufind01.dmz1.zbw.eu/10004973581