Optimal due-date assignment for a single machine sequencing problem with random processing times

1986 ◽  
Vol 17 (8) ◽  
pp. 1139-1144 ◽  
Author(s):  
T. C. E. CHENG
Keyword(s):  
Single Machine ◽  
Due Date ◽  
Due Date Assignment ◽  
Sequencing Problem ◽  
Processing Times

Single Machine Scheduling and due Date Assignment with Past-Sequence-Dependent Delivery Times and General Position-Dependent Processing Times

2014 ◽  
Vol 624 ◽  
pp. 675-680
Author(s):  
Yu Fang Zhao
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problems ◽  
Due Date ◽  
Due Date Assignment ◽  
Processing Times ◽  
Delivery Times ◽  
Weighted Number ◽  
Tardy Jobs

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.

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 ◽  
Author(s):  
Yu Fang Zhao
Keyword(s):  
Single Machine ◽  
Dynamic Programming Algorithm ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Programming Algorithm ◽  
Due Date ◽  
Due Date Assignment ◽  
Processing Times ◽  
Delivery Times ◽  
Tardy Jobs

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.

Sign in / Sign up

Export Citation Format

Share Document