Scheduling step-deteriorating jobs to minimize the total completion time

T. C.E. Cheng, Svetlana A. Kravchenko, Bertrand M.T. Lin*

*此作品的通信作者

研究成果: Article同行評審

13 引文 斯高帕斯(Scopus)

摘要

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.

原文English
文章編號106329
期刊Computers and Industrial Engineering
144
DOIs
出版狀態Published - 6月 2020

指紋

深入研究「Scheduling step-deteriorating jobs to minimize the total completion time」主題。共同形成了獨特的指紋。

引用此