A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective
- 1 February 2016
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 66, 44-57
- https://doi.org/10.1016/j.cor.2015.07.011
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Machine schedulingPublished by JSTOR ,2018
- Enhancing local search algorithms for job shops with min-sum objectives by approximate move evaluationJournal of Scheduling, 2013
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problemComputers & Operations Research, 2011
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problemComputers & Operations Research, 2008
- A large step random walk for minimizing total weighted tardiness in a job shopJournal of Scheduling, 2000
- New dispatching rules for shop scheduling: A step forwardInternational Journal of Production Research, 2000
- Tabu search for minimizing total tardiness in a job shopInternational Journal of Production Economics, 2000
- Guided Local Search with Shifting Bottleneck for Job Shop SchedulingManagement Science, 1998
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993
- The Shifting Bottleneck Procedure for Job Shop SchedulingManagement Science, 1988