Scheduling step-deteriorating jobs to minimize the total completion time
檔案
本條目沒有附加檔案。
日期
2020-06-01
期刊名稱
COMPUTERS & INDUSTRIAL ENGINEERING
摘要
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.