Reconsidering mixed integer programming and MIP-based hybrids for scheduling

DOI10.1007/978-3-642-29828-8_14MaRDI QIDQ2902928zbMATH OpenOpenAlexFDO

Authors Stefan Heinz, J. Christopher Beck

Publication date 22 August 2012

Published in Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29828-8_14

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling
• Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling
• Mixed integer programming models for job shop scheduling: A computational analysis
• Algorithms for hybrid MILP/CP models for a class of optimization problems
• Principles and Practice of Constraint Programming – CP 2004

Cited in

(21)

• IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
• An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling
• Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
• Solving planning and scheduling problems with combined integer and constraint programming
• Computational aspects of infeasibility analysis in mixed integer programming
• Exact optimization and decomposition approaches for shelf space allocation
• Hybrid algorithm for scheduling with regard for reinvestment of profits
• Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
• Parallel composition of scheduling solvers
• Algorithms for hybrid MILP/CP models for a class of optimization problems
• Mixed integer programming models for job shop scheduling: A computational analysis
• Modeling the Regular Constraint with Integer Programming
• Incorporating the strength of MIP modeling in schedule construction
• Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem
• Mixed integer programming approaches to planning and scheduling in electronics supply chains
• Hybrid MIP-CP techniques to solve a multi-machine assignment and scheduling problem in Xpress-CP
• A comparative study of MIP and CP formulations for the B2B scheduling optimization problem
• Scheduling experiments on a nulear reactor using mixed integer programming
• Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook
• Solving scheduling problems from high-level models
• A mixed integer programming model for advanced planning and scheduling (APS)

Describes a project that uses

Uses Software

• SCIP
• MIPLIB

This page was built for publication: Reconsidering mixed integer programming and MIP-based hybrids for scheduling

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