Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5128341 | Operations Research Letters | 2017 | 6 Pages |
Abstract
In this paper we study a parallel machine scheduling problem with non-renewable resource constraints. That is, besides the jobs and machines, there is a common non-renewable resource consumed by the jobs, which has an initial stock and some additional supplies over time. Unlike in most previous results, the number of machines is part of the input. We describe a polynomial time approximation scheme for minimizing the makespan.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Péter Györgyi,