Solving planning and scheduling problems with combined integer and constraint programming
From MaRDI portal
Recommendations
- A hybrid method for the planning and scheduling
- Principles and Practice of Constraint Programming – CP 2004
- Reconsidering mixed integer programming and MIP-based hybrids for scheduling
- Algorithms for hybrid MILP/CP models for a class of optimization problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Cited in
(20)- Conceptual models for combined planning and scheduling
- Data-driven feasibility analysis for the integration of planning and scheduling problems
- scientific article; zbMATH DE number 5547917 (Why is no real title available?)
- Constraint programming and operations research
- On a Practical, Integer-Linear Programming Model for Delete-Free Tasks and its Use as a Heuristic for Cost-Optimal Planning
- Multilevel capacitated lot-sizing and resource-constrained project scheduling: an integrating perspective
- Single-facility scheduling by logic-based Benders decomposition
- A mixed integer programming model for advanced planning and scheduling (APS)
- Campaign planning in time-indexed model formulations
- Polylithic modeling and solution approaches using algebraic modeling systems
- An integrated method for planning and scheduling to minimize tardiness
- A cutting plane approach for integrated planning and scheduling
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- A hybrid VNS approach for the short-term production planning and scheduling: a case study in the pulp and paper industry
- A graph-based constraint programming approach for the integrated process planning and scheduling problem
- Combined planning and scheduling in a divergent production system with co-production: a case study in the lumber industry
- SCIP: solving constraint integer programs
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Combining linear programming and satisfiability solving for resource planning
- Logic-based Benders decomposition for large-scale optimization
This page was built for publication: Solving planning and scheduling problems with combined integer and constraint programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864438)