Earliness-tardiness scheduling around almost equal due dates
January 1997
Article
pp 92-99.
This publication is part of collection
| Related Files |
|---|
View PDF Version
(EarlinessTardiness_1997.pdf, 0.7MB) |
Discusses the existence of another class of problems that are structurally less complicated than the general earliness-tardiness problem. Details of common due date problems; Logic behind Emmons' matching algorithm; List of earliness-tardiness problems to which the optimality principle of the dynamic algorithm applies; Properties that apply to the variants of dynamic programming.
Keywords
