A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- 31 August 2008
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 35 (8), 2599-2616
- https://doi.org/10.1016/j.cor.2006.12.019
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A hybrid genetic algorithm for the job shop scheduling problemEuropean Journal of Operational Research, 2005
- A large step random walk for minimizing total weighted tardiness in a job shopJournal of Scheduling, 2000
- Tabu search for minimizing total tardiness in a job shopInternational Journal of Production Economics, 2000
- Deterministic job-shop scheduling: Past, present and futureEuropean Journal of Operational Research, 1999
- A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shopNaval Research Logistics (NRL), 1999
- A Fast Taboo Search Algorithm for the Job Shop ProblemManagement Science, 1996
- Job-shop scheduling: Computational study of local search and large-step optimization methodsEuropean Journal of Operational Research, 1995
- A genetic algorithm for the job shop problemComputers & Operations Research, 1995
- Job Shop Scheduling by Simulated AnnealingOperations Research, 1992
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyPublished by Elsevier BV ,1979