Combining Constraint Programming and Local Search for Job-Shop Scheduling
From MaRDI portal
Publication:2899096
DOI10.1287/ijoc.1100.0388zbMath1243.90056OpenAlexW2027524005MaRDI QIDQ2899096
J. Christopher Beck, Tianke Feng, Jean-Paul Watson
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f430850caea561323b9c555da15f9c4699373935
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (13)
Job-shop local-search move evaluation without direct consideration of the criterion's value ⋮ An integrated search heuristic for large-scale flexible job shop scheduling problems ⋮ A tabu search/path relinking algorithm to solve the job shop scheduling problem ⋮ Genetic tabu search for the fuzzy flexible job shop problem ⋮ Scatter search with path relinking for the job shop with time lags and setup times ⋮ A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem ⋮ Mixed integer programming models for job shop scheduling: A computational analysis ⋮ Underground mine scheduling of mobile machines using constraint programming and large neighborhood search ⋮ A graph-based constraint programming approach for the integrated process planning and scheduling problem ⋮ A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem ⋮ Instance space analysis and algorithm selection for the job shop scheduling problem ⋮ A time-indexed LP-based approach for min-sum job-shop problems ⋮ Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports
This page was built for publication: Combining Constraint Programming and Local Search for Job-Shop Scheduling
