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

Theoretical Computer Science ◽

10.1016/j.tcs.2006.08.030 ◽

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

Download Full-text

A faster fully polynomial approximation scheme for the single-machine total tardiness problem

European Journal of Operational Research ◽

10.1016/j.ejor.2007.12.031 ◽

2009 ◽

Vol 193 (2) ◽

pp. 637-638 ◽

Author(s):

Christos Koulamas

Keyword(s):

Polynomial Approximation ◽

Single Machine ◽

Approximation Scheme ◽

Total Tardiness ◽

Fully Polynomial Approximation Scheme

Download Full-text

A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work

Mathematics of Operations Research ◽

10.1287/moor.19.1.86 ◽

1994 ◽

Vol 19 (1) ◽

pp. 86-93 ◽

Author(s):

M. Y. Kovalyov ◽

C. N. Potts ◽

L. N. van Wassenhove

Keyword(s):

Polynomial Approximation ◽

Single Machine ◽

Approximation Scheme ◽

Late Work ◽

Fully Polynomial Approximation Scheme

Download Full-text

A fully polynomial approximation scheme for the total tardiness problem

Operations Research Letters ◽

10.1016/0167-6377(82)90022-0 ◽

1982 ◽

Vol 1 (6) ◽

pp. 207-208 ◽

Author(s):

E.L. Lawler

Keyword(s):

Polynomial Approximation ◽

Approximation Scheme ◽

Total Tardiness ◽

Fully Polynomial Approximation Scheme

Download Full-text

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

Proceedings of the 2004 American Control Conference ◽

10.23919/acc.2004.1384773 ◽

2004 ◽

Author(s):

Chunfu Jia

Keyword(s):

Single Machine ◽

Due Date ◽

Common Due Date ◽

Earliness And Tardiness ◽

Processing Times ◽

Weighted Earliness

Download Full-text

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

Discrete Applied Mathematics ◽

10.1016/0166-218x(96)80468-9 ◽

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

Download Full-text

An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date

Operations Research Letters ◽

10.1016/0167-6377(95)00006-6 ◽

1995 ◽

Vol 17 (3) ◽

pp. 149-152 ◽

Author(s):

Jose A. Ventura ◽

Michael X. Weng

Keyword(s):

Dynamic Programming ◽

Single Machine ◽

Dynamic Programming Algorithm ◽

Programming Algorithm ◽

Mean Absolute Deviation ◽

Due Date ◽

Absolute Deviation ◽

Common Due Date ◽

Deviation Problem ◽

Improved Dynamic Programming

Download Full-text

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

Computers & Operations Research ◽

10.1016/s0305-0548(02)00066-7 ◽

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

Download Full-text

Metaheuristics for Common due Date Total Earliness and Tardiness Single Machine Scheduling Problem

Computational Intelligence in Flow Shop and Job Shop Scheduling - Studies in Computational Intelligence ◽

10.1007/978-3-642-02836-6_10 ◽

2009 ◽

pp. 301-340

Author(s):

M. Fatih Tasgetiren ◽

Quan-Ke Pan ◽

P. N. Suganthan ◽

Yun-Chia Liang ◽

Tay Jin Chua

Keyword(s):

Single Machine ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Scheduling Problem ◽

Due Date ◽

Common Due Date ◽

Earliness And Tardiness

Download Full-text

A new single machine scheduling problems with dynamic arrival time and setup consideration in a common due date environment by using the Inver-over CX

Proceedings of the 8th International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS) ◽

10.4108/icst.bict.2014.257888 ◽

2015 ◽

Author(s):

Shih-Hsin Chen

Keyword(s):

Single Machine ◽

Arrival Time ◽

Machine Scheduling ◽

Single Machine Scheduling ◽

Scheduling Problems ◽

Due Date ◽

Common Due Date ◽

Machine Scheduling Problems

Download Full-text

Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date

European Journal of Operational Research ◽

10.1016/j.ejor.2019.12.003 ◽

2020 ◽

Vol 284 (1) ◽

pp. 67-74 ◽

Author(s):

Xin Chen ◽

Yage Liang ◽

Małgorzata Sterna ◽

Wen Wang ◽

Jacek Błażewicz

Keyword(s):

Polynomial Time ◽

Parallel Machines ◽

Approximation Scheme ◽

Polynomial Time Approximation Scheme ◽

Due Date ◽

Common Due Date ◽

Time Approximation ◽

Polynomial Time Approximation

Download Full-text