A very fast TS/SA algorithm for the job shop scheduling problem
From MaRDI portal
Publication:2384605
DOI10.1016/j.cor.2006.02.024zbMath1149.90345MaRDI QIDQ2384605
Yun-Qing Rao, Chaoyong Zhang, Peigen Li, Zailin Guan
Publication date: 10 October 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.02.024
90B40: Search theory
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- The job shop scheduling problem: Conventional and new solution techniques
- A genetic algorithm for the job shop problem
- Evolution based learning in a job shop scheduling environment
- Tabu search and finite convergence
- Two simulated annealing-based heuristics for the job shop scheduling problem
- Deterministic job-shop scheduling: Past, present and future
- Future paths for integer programming and links to artificial intelligence
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- Benchmarks for basic scheduling problems
- Applying tabu search to the job-shop scheduling problem
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Job Shop Scheduling by Simulated Annealing
- Tabu Search—Part I
- Tabu Search—Part II
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- A Computational Study of the Job-Shop Scheduling Problem
- The Complexity of Flowshop and Jobshop Scheduling
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- A Fast Taboo Search Algorithm for the Job Shop Problem
- New and ``stronger job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996)
