An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem
From MaRDI portal
Publication:6066724
DOI10.1111/itor.12445OpenAlexW2599096304MaRDI QIDQ6066724
Thomas Jatschka, Günther R. Raidl, Johannes Maschler, Martin Georg Riedler
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12445
mixed integer linear programmingresource-constrained project schedulingmatheuristicsparticle therapytime-bucket relaxation
Related Items (7)
A project scheduling problem with periodically aggregated resource-constraints ⋮ Particle therapy patient scheduling with limited starting time variations of daily treatments ⋮ A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ An updated survey of variants and extensions of the resource-constrained project scheduling problem ⋮ A matheuristic for the generalized order acceptance and scheduling problem ⋮ Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
Cites Work
- Unnamed Item
- Unnamed Item
- A rough-cut capacity planning model with overlapping
- An integer programming approach to the multimode resource-constrained multiproject scheduling problem
- A note on ``Event-based MILP models for resource-constrained project scheduling problems
- An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
- LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
- Event-based MILP models for resource-constrained project scheduling problems
- A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
- Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound
- Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
- A note on the problem of reporting maximal cliques
- A survey of variants and extensions of the resource-constrained project scheduling problem
- Consistency in networks of relations
- Lower bounds for the event scheduling problem with consumption and production of resources
- On the strength of time-indexed formulations for the resource-constrained project scheduling problem
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
- A dual heuristic for mixed integer programming
- Resource-constrained project scheduling: Notation, classification, models, and methods
- A solution approach to find the critical path in a time-constrained activity network
- A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems
- A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows
- Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem
- Time-Indexed Formulations and the Total Weighted Tardiness Problem
- Solving Project Scheduling Problems by Minimum Cut Computations
- Planning and Scheduling by Logic-Based Benders Decomposition
- A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem
- The Continuous-Time Service Network Design Problem
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
- Algorithm 457: finding all cliques of an undirected graph
This page was built for publication: An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem
