1997
Earliness-tardiness scheduling around almost equal due dates
Publication
Publication
I N F O R M S Journal on Computing: charting new directions in OR and CS p. 92- 99
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.
| Additional Metadata | |
|---|---|
| , , , | |
| hdl.handle.net/1765/12343 | |
| ERIM Article Series (EAS) | |
| I N F O R M S Journal on Computing: charting new directions in OR and CS | |
| Organisation | Erasmus Research Institute of Management |
|
Hoogeveen, H., & van de Velde, S. (1997). Earliness-tardiness scheduling around almost equal due dates. I N F O R M S Journal on Computing: charting new directions in OR and CS, 92–99. Retrieved from http://hdl.handle.net/1765/12343 |
|
