A Position-Based Propagator for the Open-Shop Problem

DOI10.1007/978-3-540-72397-4_14MaRDI QIDQ3612418zbMATH OpenOpenAlexFDO

Authors

Publication date 10 March 2009

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72397-4_14

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Solving the open shop scheduling problem
• An optimal constraint programming approach to the open-shop problem
• A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions
• New efficient heuristics for scheduling open shops with makespan minimization
• Constraint Propagation Based Scheduling of Job Shops

Cited in

(3)

• Some positive news on the proportionate open shop problem
• An optimal constraint programming approach to the open-shop problem
• Solving scheduling problems from high-level models

This page was built for publication: A Position-Based Propagator for the Open-Shop Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612418)