scholarly journals A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date

2006 ◽  
Vol 369 (1-3) ◽  
pp. 230-238 ◽  
Author(s):  
Hans Kellerer ◽  
Vitaly A. Strusevich
Keyword(s):  
Polynomial Approximation ◽  
Single Machine ◽  
Approximation Scheme ◽  
Total Tardiness ◽  
Due Date ◽  
Common Due Date ◽  
Fully Polynomial Approximation Scheme

scholarly journals Batch scheduling and common due-date assignment on a single machine

1996 ◽  
Vol 70 (3) ◽  
pp. 231-245 ◽  
Author(s):  
T.C.Edwin Cheng ◽  
Mikhail Y. Kovalyov
Keyword(s):  
Single Machine ◽  
Batch Scheduling ◽  
Due Date ◽  
Due Date Assignment ◽  
Common Due Date

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