Parallel composition of scheduling solvers

DOI10.1007/978-3-319-33954-2_12MaRDI QIDQ2815103zbMATH OpenOpenAlexFDO

Authors Daniel Fontaine, Laurent Michel, Pascal Van Hentenryck

Publication date 27 June 2016

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

Full work available at URL https://doi.org/10.1007/978-3-319-33954-2_12

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel algorithms in computer science (68W10)

Recommendations

• Reconsidering mixed integer programming and MIP-based hybrids for scheduling
• aspeed: solver scheduling via answer set programming
• scientific article; zbMATH DE number 6261538
• Solving scheduling problems from high-level models
• Principles and Practice of Constraint Programming – CP 2004

Cited in

(2)

• A composite algorithm for multiprocessor scheduling
• Parallel cooperative approaches for the labor constrained scheduling problem

This page was built for publication: Parallel composition of scheduling solvers

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