Job-shop local-search move evaluation without direct consideration of the criterion's value
From MaRDI portal
Publication:2629670
DOI10.1016/j.ejor.2014.08.044zbMath1339.90144MaRDI QIDQ2629670
Publication date: 6 July 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.08.044
90B35: Deterministic scheduling theory in operations research
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- A repairing technique for the local search of the job-shop problem.
- Deterministic job-shop scheduling: Past, present and future
- Benchmarks for basic scheduling problems
- Applying tabu search to the job-shop scheduling problem
- A very fast TS/SA algorithm for the job shop scheduling problem
- An advanced tabu search algorithm for the job shop problem
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- Combining Constraint Programming and Local Search for Job-Shop Scheduling
- A Simple Optimised Search Heuristic for the Job Shop Scheduling Problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Job Shop Scheduling by Simulated Annealing
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Job Shop Scheduling by Local Search
- New and ``stronger job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996)
