An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling
From MaRDI portal
Publication:1626765
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Recommendations
- Reconsidering mixed integer programming and MIP-based hybrids for scheduling
- Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling
- Mixed integer programming models for job shop scheduling: A computational analysis
- Principles and Practice of Constraint Programming – CP 2004
- A hybrid method for the planning and scheduling
Cited in
(19)- IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
- 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
- The sample analysis machine scheduling problem: definition and comparison of exact solving approaches
- An efficient filtering algorithm for the unary resource constraint with transition times and optional activities
- 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
- Reconsidering mixed integer programming and MIP-based hybrids for scheduling
- Mixed integer programming models for job shop scheduling: A computational analysis
- Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem
- A comparative study of MIP and CP formulations for the B2B scheduling optimization 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
- Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook
- A reactive iterated greedy algorithm for the no-wait flowshop to minimize total tardiness
- A comparative computational study for parallel-machine problems with sustainable manufacturing constraints
- A constraint-programming approach for the storage space allocation problem in a distribution center
- A Q-learning-based variable greedy algorithm to minimize the sum of total earliness and tardiness in a no-wait flowshop scheduling problem
This page was built for publication: An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1626765)
