Combining constraint programming and temporal decomposition approaches -- scheduling of an industrial formulation plant

DOI10.1007/978-3-030-78230-6_9OpenAlexW3166111546MaRDI QIDQ2117209

Vassilios Yfantis, Sebastian Engell, Christian Klanke, Dominik R. Bleidorn

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-78230-6_9

zbMATH Keywords

constraint programmingdecomposition algorithmbatch process schedulingmoving-horizon

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• OR-tools

Cites Work

• Mixed integer programming models for job shop scheduling: A computational analysis
• An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling
• A global constraint for total weighted completion time for unary resources
• Unnamed Item
• Unnamed Item

This page was built for publication: Combining constraint programming and temporal decomposition approaches -- scheduling of an industrial formulation plant