Single Machine Scheduling and due Date Assignment with Past-Sequence-Dependent Delivery Times and General Position-Dependent Processing Times
We studied single machine scheduling problems in which the jobs need to be delivered to customers after processing. It is assumed that the delivery times are proportional to the length of the already processed jobs, and a job's processing time depended on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs and the cost of due date assignment. We analyzed these problems with two different due date assignment methods and conclude that the problems are polynomial time solvable.
Y. F. Zhao, "Single Machine Scheduling and due Date Assignment with Past-Sequence-Dependent Delivery Times and General Position-Dependent Processing Times", Applied Mechanics and Materials, Vol. 624, pp. 675-680, 2014