A survey of algorithms for the single machine total weighted tardiness scheduling problem
- 31 March 1990
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 26 (2-3), 235-253
- https://doi.org/10.1016/0166-218x(90)90103-j
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Dynamic Programming State-Space Relaxation for Single-Machine SchedulingJournal of the Operational Research Society, 1988
- Dynamic programming and decomposition approaches for the single machine total tardiness problemEuropean Journal of Operational Research, 1987
- State‐space relaxation procedures for the computation of bounds to routing problemsNetworks, 1981
- Four solution techniques for a general one machine scheduling problem: A comparative studyEuropean Journal of Operational Research, 1978
- A dual algorithm for the one-machine scheduling problemMathematical Programming, 1976
- An experimental comparison of solution algorithms for the single‐machine tardiness problemNaval Research Logistics Quarterly, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Science and Business Media LLC ,1974
- An Improved Method for Scheduling Independent TasksA I I E Transactions, 1971
- A hybrid algorithm for the one machine sequencing problem to minimize total tardinessNaval Research Logistics Quarterly, 1971
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956