Principles for the design of large neighborhood search

DOI10.1007/s10852-008-9100-2zbMath1179.90129OpenAlexW1979684104MaRDI QIDQ846169

J. Christopher Beck, Tom Carchrae

Publication date: 1 February 2010

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-008-9100-2

zbMATH Keywords

optimizationschedulingmachine learningconstraint programminglarge neighborhood search

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Search theory (90B40) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

An integrated search heuristic for large-scale flexible job shop scheduling problems ⋮ A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem ⋮ Underground mine scheduling of mobile machines using constraint programming and large neighborhood search ⋮ Short-term scheduling of production fleets in underground mines using CP-based LNS

Uses Software

• LSSPER
• JOBSHOP
• ILOG SCHEDULE

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal speedup of Las Vegas algorithms
• LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
• Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
• Temporal constraint networks
• Variable neighborhood search
• Constraint-based job shop scheduling with Ilog Scheduler
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Solving a network design problem
• Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
• Benchmarks for basic scheduling problems
• Combining local and global search in a constraint programming environment
• Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• A Computational Study of the Job-Shop Scheduling Problem
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Principles for the design of large neighborhood search