@article{5216cfc3029f4fd5bb359440fe1c8d27,
title = "Scheduling step-deteriorating jobs to minimize the total completion time",
abstract = "We consider single-machine scheduling to minimize the total completion time, where the processing time of a job is a step function of its start time. In this paper we establish the complexity status of the problem by proving its NP-hardness and developing a dynamic programming algorithm that solves the problem in pseudo-polynomial time.",
keywords = "Dynamic programming, Ordinary NP-hardness, Single-machine scheduling, Step deterioration, Total completion time",
author = "Cheng, {T. C.E.} and Kravchenko, {Svetlana A.} and Lin, {Bertrand M.T.}",
note = "Publisher Copyright: {\textcopyright} 2020 Elsevier Ltd",
year = "2020",
month = jun,
doi = "10.1016/j.cie.2020.106329",
language = "English",
volume = "144",
journal = "Computers and Industrial Engineering",
issn = "0360-8352",
publisher = "Elsevier Ltd",
}