Approximability of total weighted completion
time with resource consuming jobs
Létrehozó:
Kis, Tamás
Dátum:
2015
Téma:
QA Mathematics / matematika
Tartalmi leírás:
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
Kis, Tamás (2015) Approximability of total weighted completion time with resource consuming jobs. Operations Research Letters. ISSN 0167-6377 (In Press)
