Minimizing weighted earliness and tardiness penalties about a common due date on single machine with exponential processing times

2004 ◽  
Author(s):  
Chunfu Jia
Keyword(s):  
Single Machine ◽  
Due Date ◽  
Common Due Date ◽  
Earliness And Tardiness ◽  
Processing Times ◽  
Weighted Earliness

Single-Machine Batch Delivery Scheduling and Common due Date Assignment with Identical Processing Times

2014 ◽  
Vol 635-637 ◽  
pp. 1884-1889 ◽  
Author(s):  
Xing Zi Xie ◽  
Xiu Li Wang
Keyword(s):  
Single Machine ◽  
Optimal Schedule ◽  
Dynamic Programming Algorithm ◽  
Programming Algorithm ◽  
Due Date ◽  
Common Due Date ◽  
Processing Times ◽  
Batch Delivery ◽  
Weighted Earliness ◽  
Delivery Scheduling

This paper considers the problem of single-machine batch delivery scheduling with an assignable common due date where all jobs have identical processing times. Finished jobs are delivered in batches and the cost per batch delivery is fixed and independent of the number of jobs in the batch. For our problem, the penalties of earliness-tardiness are assumed to be arbitrarily weighted but the holding costs are equally weighted. The objective is to determine the common due date and find an optimal schedule to minimize the sum of total weighted earliness, tardiness, holding, due date, and delivery costs. We present some basic properties of the structure of the optimal schedule for the problem, and provide a polynomial dynamic programming algorithm.

Single machine scheduling with a variable common due date and resource-dependent processing times

2003 ◽  
Vol 30 (8) ◽  
pp. 1173-1185 ◽  
Author(s):  
C.T.Daniel Ng ◽  
T.C.Edwin Cheng ◽  
Mikhail Y. Kovalyov ◽  
S.S. Lam
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Due Date ◽  
Common Due Date ◽  
Processing Times
Sign in / Sign up

Export Citation Format

Share Document