Single Machine Scheduling and Due Date Assignment with Past-Sequence-Dependent Delivery Times and Position-Dependent Processing Times
2014 ◽
Vol 1006-1007
◽
pp. 498-503
◽
Keyword(s):
Due Date
◽
This paper considers single machine scheduling and due date assignment 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 depends 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 analyze the problems with two different due date assignment methods and conclude that the problems are polynomial time solvable. We provide a dynamic programming algorithm with O(n3) times for the problems.
2014 ◽
Vol 624
◽
pp. 675-680
2008 ◽
Vol 69
(2)
◽
pp. 271-280
◽
2014 ◽
Vol 248
◽
pp. 503-510
◽
2006 ◽
Vol 25
◽
pp. 139-142
◽
2016 ◽
Vol 33
(1)
◽
pp. 239-249
◽