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

DOI10.1007/978-3-030-78230-6_9MaRDI QIDQ2117209zbMATH OpenOpenAlexFDO

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

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

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

Cites work

• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• A global constraint for total weighted completion time for unary resources
• An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling
• Mixed integer programming models for job shop scheduling: A computational analysis

Cited in

(1)

• A complex time based construction heuristic for batch scheduling problems in the chemical industry

Describes a project that uses

Uses Software

• OR-tools

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

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