An experimental analysis of local minima to improve neighbourhood search.

DOI10.1016/S0305-0548(02)00128-4zbMath1039.90101MaRDI QIDQ1422374

C. K. Wong, K. Steinhöfel, Andreas A. Albrecht

Publication date: 14 February 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

Combinatorial optimization; annealing; Job shop scheduling; Benchmark problems; Disjunctive graphs; Simulated

Mathematics Subject Classification ID

90C15: Stochastic programming

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

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

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