An experimental analysis of local minima to improve neighbourhood search.
From MaRDI portal
Publication:1422374
DOI10.1016/S0305-0548(02)00128-4zbMath1039.90101OpenAlexW1965602396MaRDI QIDQ1422374
K. Steinhöfel, C. K. Wong, Andreas A. Albrecht
Publication date: 14 February 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00128-4
Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (4)
A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling ⋮ A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem ⋮ Heuristics for automated knowledge source integration and service composition ⋮ Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- NP-complete scheduling problems
- Two simulated annealing-based heuristics for the job shop scheduling problem
- Some new results on simulated annealing applied to the job shop scheduling problem
- Deterministic job-shop scheduling: Past, present and future
- Solving various weighted matching problems with constraints
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- 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
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- Job Shop Scheduling by Local Search
This page was built for publication: An experimental analysis of local minima to improve neighbourhood search.
