An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
Authors:
- A GrossoAGA Grosso
- F Della CroceFCF Della Croce
- R TadeiRTR Tadei
- 1 January 2004
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 32 (1) , 68-72
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling ProblemINFORMS Journal on Computing, 2002
- Ant Colony Optimization for the Total Weighted Tardiness Problem2000
- Generalized pairwise interchanges and machine schedulingEuropean Journal of Operational Research, 1995
- A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness1977
- Minimizing Total Costs in One-Machine SchedulingOperations Research, 1975