Reconsidering Mixed Integer Programming and MIP-Based Hybrids for Scheduling

DOI10.1007/978-3-642-29828-8_14zbMath1382.90064OpenAlexW1509282541MaRDI QIDQ2902928

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

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

Related Items (3)

Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling ⋮ Computational aspects of infeasibility analysis in mixed integer programming ⋮ Exact optimization and decomposition approaches for shelf space allocation

Uses Software

• SCIP
• MIPLIB

This page was built for publication: Reconsidering Mixed Integer Programming and MIP-Based Hybrids for Scheduling