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

Jose A. Ventura, Michael X. Weng

Research output: Contribution to journalArticle

10 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)149-152
Number of pages4
JournalOperations Research Letters
Volume17
Issue number3
DOIs
StatePublished - Apr 1995

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Cite this