Györgyi, Péter (2016) A PTAS for a resource scheduling problem with arbitrary number of parallel machines. Operations Research Letters. pp. 1-7. ISSN 0167-6377 (In Press)
|
Text
parallel_ptas2_rev3.pdf Download (413kB) | Preview |
Official URL: https://doi.org/10.1016/j.orl.2017.09.007
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.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Depositing User: | Péter Györgyi |
| Date Deposited: | 23 Aug 2016 11:20 |
| Last Modified: | 29 Sep 2017 12:15 |
| URI: | http://real.mtak.hu/id/eprint/39080 |
Actions (login required)
 |
Edit Item |
