Combining constraint programming and local search for job-shop scheduling
DOI10.1287/IJOC.1100.0388zbMATH Open1243.90056OpenAlexW2027524005MaRDI QIDQ2899096FDOQ2899096
Authors: J. Christopher Beck, T. K. 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
Recommendations
- A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem
- Combining local and global search in a constraint programming environment
- Local search with constraint propagation and conflict-based heuristics
- Job Shop Scheduling by Local Search
- Local Search and Constraint Programming
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cited In (19)
- Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
- Constraint programming and local search heuristic: a matheuristic approach for routing and scheduling feeder vessels in multi-terminal ports
- Local search with constraint propagation and conflict-based heuristics
- A tabu search/path relinking algorithm to solve the job shop scheduling problem
- 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
- Title not available (Why is that?)
- Job-shop local-search move evaluation without direct consideration of the criterion's value
- 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 graph-based constraint programming approach for the integrated process planning and scheduling problem
- A time-indexed LP-based approach for min-sum job-shop problems
- 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
- Combining local and global search in a constraint programming environment
- Mixed integer programming models for job shop scheduling: A computational analysis
- A hybrid approach to scheduling with earliness and tardiness costs
- Underground mine scheduling of mobile machines using constraint programming and large neighborhood search
- A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem
This page was built for publication: Combining constraint programming and local search for job-shop scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2899096)
