| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142273 | Operations Research Letters | 2015 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Tamás Kis,