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

Authors:
Jose A. Ventura;Michael X. Weng
Affiliations:
Department of Industrial and Management Systems Engineering, 207 Hammond Building, The Pennsylvania State University, University Park, PA 16802, USA;Department of Industrial and Management Systems Engineering, 207 Hammond Building, The Pennsylvania State University, University Park, PA 16802, USA
Venue:
Operations Research Letters
Year:
1995

Citing 2
Cited 1

Earliness-tardiness scheduling problems: II. Derivation of completion times about a restrictive common due date

Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In 1991, Hall et al. showed that the problem of minimizing the mean earliness and tardiness of n jobs scheduled on a single machine around a restrictive common due date is NP-complete. They proposed a pseudo-polynomial dynamic programming algorithm, called Optcet, for identifying an optimal schedule. This paper points out that two of the three subroutines in Optcet can be eliminated and, consequently, the total computational effort can be reduced significantly.