Dynamic programming and decomposition approaches for the single machine total tardiness problem
- 1 December 1987
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 32 (3) , 405-414
- https://doi.org/10.1016/s0377-2217(87)80008-5
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An Algorithm for the Single-Machine Sequencing Problem to Minimize Total TardinessIIE Transactions, 1983
- A fully polynomial approximation scheme for the total tardiness problemOperations Research Letters, 1982
- A decomposition algorithm for the single machine total tardiness problemOperations Research Letters, 1982
- On Dynamic Programming Methods for Assembly Line BalancingOperations Research, 1982
- Dynamic Programming Solution of Sequencing Problems with Precedence ConstraintsOperations Research, 1978
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine SchedulingOperations Research, 1978
- A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total TardinessPublished by Elsevier ,1977
- A dual algorithm for the one-machine scheduling problemMathematical Programming, 1976
- Minimizing Total Costs in One-Machine SchedulingOperations Research, 1975
- One-Machine Sequencing to Minimize Certain Functions of Job TardinessOperations Research, 1969