Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling
From MaRDI portal
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Mixed integer programming (90C11)
Recommendations
- A constraint integer programming approach for resource-constrained project scheduling
- scientific article; zbMATH DE number 1264426
- Resource-constraints based optimization scheduling approach for concurrent activities
- A constraint programming approach for the resource-constrained project scheduling problem
- scientific article; zbMATH DE number 4174368
- Lagrangian relaxation and constraint generation for allocation and advanced scheduling
- On some implementations of solving the resource constrained project scheduling problems
- scientific article; zbMATH DE number 802345
- New Benchmark Results for the Resource-Constrained Project Scheduling Problem
- An integer programming approach to the multimode resource-constrained multiproject scheduling problem
Cited in
(4)- An update on the comparison of MIP, CP and hybrid approaches for mixed resource allocation and scheduling
- Reconsidering mixed integer programming and MIP-based hybrids for scheduling
- Reservation table scheduling: branch-and-bound based optimizationvs. integer linear programming techniques
- Evaluating and tuning n-fold integer programming
This page was built for publication: Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922901)
