An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling
From MaRDI portal
Publication:1626765
DOI10.1007/978-3-319-93031-2_29OpenAlexW2807159754MaRDI QIDQ1626765
Publication date: 21 November 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-93031-2_29
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) 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 (10)
IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG ⋮ The sample analysis machine scheduling problem: definition and comparison of exact solving approaches ⋮ Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem ⋮ Underground mine scheduling of mobile machines using constraint programming and large neighborhood search ⋮ A graph-based constraint programming approach for the integrated process planning and scheduling problem ⋮ A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions ⋮ A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization ⋮ An efficient filtering algorithm for the unary resource constraint with transition times and optional activities ⋮ Combining constraint programming and temporal decomposition approaches -- scheduling of an industrial formulation plant ⋮ Short-term scheduling of production fleets in underground mines using CP-based LNS
Uses Software
This page was built for publication: An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling
