|
|||||
|
|
Dynamic programming and decomposition approaches for the single machine total tardiness problem |
|
| Affiliation: | 1. Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands;2. Department of Management Science, Lancaster University Management School, Lancaster, LA1 4YX, UK;3. BCAM — Basque Center for Applied Mathematics, Mazarredo 14, 48009, Bilbao (Basque Country), Spain |
| Abstract: | The problem of sequencing jobs on a single machine to minimize total tardiness is considered. General precedence constrained dynamic programming algorithms and special-purpose decomposition algorithms are presented. Computational results for problems with up to 100 jobs are given. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |