Scheduling step-deteriorating jobs to minimize the total completion time

dc.citation.epage	0	en_US
dc.citation.spage	0	en_US
dc.citation.volume	144	en_US
dc.citation.woscount	0	en_US
dc.contributor.author	Cheng, T. C. E.	en_US
dc.contributor.author	Kravchenko, Svetlana A.	en_US
dc.contributor.author	Lin, Bertrand M. T.	en_US
dc.contributor.department	資訊管理與財務金融系註：原資管所+財金所	zh_TW
dc.contributor.department	Department of Information Management and Finance	en_US
dc.date.accessioned	2020-07-01T05:22:10Z
dc.date.available	2020-07-01T05:22:10Z
dc.date.issued	2020-06-01	en_US
dc.description.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.	en_US
dc.identifier.doi	10.1016/j.cie.2020.106329	en_US
dc.identifier.issn	0360-8352	en_US
dc.identifier.journal	COMPUTERS & INDUSTRIAL ENGINEERING	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/j.cie.2020.106329	en_US
dc.identifier.uri	https://ir.lib.nycu.edu.tw/handle/11536/154591
dc.identifier.wosnumber	WOS:000535972200001	en_US
dc.language.iso	en_US	en_US
dc.subject	Single-machine scheduling	en_US
dc.subject	Step deterioration	en_US
dc.subject	Total completion time	en_US
dc.subject	Ordinary NP-hardness	en_US
dc.subject	Dynamic programming	en_US
dc.title	Scheduling step-deteriorating jobs to minimize the total completion time	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1