Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem
Published Online:1 Aug 1998https://doi.org/10.1287/ijoc.10.3.341
References
- A Survey of Algorithms for the Single Machine Total Weighted Tardiness Scheduling Problem. Discrete Applied Mathematics (1990) 26:235–253Crossref, Google Scholar
- A Genetic Algorithm for the Job Shop Problem. Computers & Operations Research (1995) 22:15–24Crossref, Google Scholar
- Threshold Accepting: a General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing. Journal of Computational Physics (1990) 90:161–175Crossref, Google Scholar
- Simulated Annealing: a Tool for Operational Research. European Journal of Operational Research (1990) 46:271–281Crossref, Google Scholar
- Tabu Search—Part I. ORSA Journal on Computing (1989) 1:190–206Link, Google Scholar
- Tabu Search: A Tutorial. Interfaces (1990) 20:74–94Link, Google Scholar
- Genetic Algorithms in Search, Optimization and Machine Learning (1989) (Addison-Wesley, Reading, MA) Google Scholar
- A “Pseudopolynomial” Algorithm for Sequencing Jobs To Minimize Total Tardiness. Annals of Discrete Mathematics (1977) 1:331–342Crossref, Google Scholar
- Complexity of machine scheduling problems. Annals of Discrete Mathematics (1977) 1:343–362Crossref, Google Scholar
- Heuristic Scheduling Algorithms (1993) (Wiley, NY) Google Scholar
- Accurate myopic heuristics for tardiness scheduling. (1984) . GSIA Working paper no. 36-83-84, Carnegie-Mellon University, PAGoogle Scholar
- General Local Search Heuristics in Combinatorial Optimization: A Tutorial. Belgian Journal of Operations Research, Statistics and Computer Science (1992) 32:8–67Google Scholar
- A Branch And Bound Algorithm for the Total Weighted Tardiness Problem. Operations Research (1985) 33:363–377Link, Google Scholar
- Single Machine Tardiness Sequencing Heuristics. IIE Transactions (1991) 23:346–354Crossref, Google Scholar

