A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem
- 1 April 2005
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 162 (1) , 281-289
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A survey of very large-scale neighborhood search techniquesDiscrete Applied Mathematics, 2002
- A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment ProblemMathematical Programming, 2000
- On the classification of NP-complete problems in terms of their correlation coefficientDiscrete Applied Mathematics, 2000
- Scheduling with time dependent processing times: Review and extensionsJournal of the Operational Research Society, 1999
- Exponential neighbourhood local search for the traveling salesman problemComputers & Operations Research, 1999
- Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling ProblemINFORMS Journal on Computing, 1998
- On the quality of local search for the quadratic assignment problemDiscrete Applied Mathematics, 1998
- A fully polynomial approximation scheme for the total tardiness problemOperations Research Letters, 1982
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness1977