Kis, Tamás (2015) Approximability of total weighted completion time with resource consuming jobs. Operations Research Letters. ISSN 0167-6377 (In Press)
 | There is a more recent version of this item available. |
|
Text
weighted_compl_rev2.pdf Download (251kB) | Preview |
Abstract
In this paper we study an extension of the single machine scheduling problem with the total weighted completion time objective, where there is a single non-renewable resource consumed by the jobs, having an initial stock and some additional replenishments over time. We prove that this problem is NP-hard in the strong sense, and provide an FPTAS for a special case with two supply dates
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| Depositing User: | Dr. Tamás Kis |
| Date Deposited: | 21 Sep 2015 14:15 |
| Last Modified: | 21 Sep 2015 14:15 |
| URI: | http://real.mtak.hu/id/eprint/27154 |
Available Versions of this Item
-
Approximability of total weighted completion
time with resource consuming jobs. (deposited 09 Sep 2015 08:33)
- Approximability of total weighted completion time with resource consuming jobs. (deposited 21 Sep 2015 14:15) [Currently Displayed]
Actions (login required)
 |
Edit Item |
