Kis, Tamás (2015) Approximability of total weighted completion time with resource consuming jobs. OPERATIONS RESEARCH LETTERS, 43 (6). pp. 595-598. ISSN 0167-6377 10.1016/j.orl.2015.09.004

Text Kis_595_2963817_z.pdf Restricted to Registered users only Download (392kB) | Request a copy

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. © 2015 Elsevier B.V. All rights reserved.

Update Item