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 language | English (US) |
---|---|
Pages (from-to) | 149-152 |
Number of pages | 4 |
Journal | Operations Research Letters |
Volume | 17 |
Issue number | 3 |
DOIs | |
State | Published - Apr 1995 |
All Science Journal Classification (ASJC) codes
- Software
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics