Heuristic data-driven feasibility on integrated planning and scheduling

DOI10.1007/978-3-030-34960-8_11MaRDI QIDQ2216005zbMATH OpenOpenAlexFDO

Authors Marco Casazza, Alberto Ceselli

Publication date 15 December 2020

Full work available at URL https://doi.org/10.1007/978-3-030-34960-8_11

zbMATH Keywords

data-drivendecision treeintegrated planning schedulingon time in full

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Data-driven feasibility analysis for the integration of planning and scheduling problems
• An Integrated Model for Job-Shop Planning and Scheduling
• Principles and Practice of Constraint Programming – CP 2004
• A hybrid method for the planning and scheduling
• A cutting plane approach for integrated planning and scheduling

Cited in

(3)

• Data-driven feasibility analysis for the integration of planning and scheduling problems
• Mathematical programming and machine learning for a task allocation game
• Constraint learning approaches to improve the approximation of the capacity consumption function in lot-sizing models

This page was built for publication: Heuristic data-driven feasibility on integrated planning and scheduling

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