Continuous-time formulations for multi-mode project scheduling
From MaRDI portal
Abstract: This paper reviews compact continuous-time formulations for the multi-mode resource-constrained project scheduling problem. Specifically, we first point out a serious flaw in an existing start-end-event-based formulation owing to inconsistent mode choices. We propose two options to formulate the missing constraints and we consider an equivalent reformulation with sparser constraint matrix. Second, we formulate an aggregate variant of an existing model that relies on on-off-events and clarify the role of mode consistency issues in such models. Third, we suggest two variants of an existing network flow formulation. We enhance our models by adapting several techniques that have been used previously, e.g., in cases with only a single mode. A large set of benchmark instances from the literature provides the basis for an up-to-date and fair computational study with an out-of-the-box solver package. We compare our models against two models from the literature. Our experiments assert confidently that network flow formulations prevail in the test bed, and they provide a hint on why event-based models become less competitive in multi-mode settings.
Recommendations
- Resource-constrained project scheduling with flexible resource profiles in continuous time
- A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags
- Event-based MILP models for resource-constrained project scheduling problems
- A note on ``Event-based MILP models for resource-constrained project scheduling problems
- A polyhedral study of event-based models for the resource-constrained project scheduling problem
Cites work
- A note on ``Event-based MILP models for resource-constrained project scheduling problems
- A polyhedral study of event-based models for the resource-constrained project scheduling problem
- A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem
- An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances
- An updated survey of variants and extensions of the resource-constrained project scheduling problem
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- Constraint-propagation-based cutting planes: an application to the resource-constrained project scheduling problem
- Event-based MILP models for resource-constrained project scheduling problems
- Insertion techniques for static and dynamic resource-constrained project scheduling.
- JGraphT—A Java Library for Graph Data Structures and Algorithms
- Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
- On the measurement of complexity in activity networks
- On the strength of time-indexed formulations for the resource-constrained project scheduling problem
- On the use of the complexity index as a measure of complexity in activity networks
- Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem
- Project scheduling with flexible resources: formulation and inequalities
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- PSPLIB -- a project scheduling problem library
- Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
- Scheduling subject to resource constraints: Classification and complexity
- The project scheduling polyhedron: Dimension, facets and lifting theorems
- The resource constrained project scheduling problem: a theoretical comparison between a recent formulation and the main time indexed linear programming based approaches
- The schedule-sequencing problem
Cited in
(5)- scientific article; zbMATH DE number 6102185 (Why is no real title available?)
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- An exact decomposition technique for the deadline-constrained discrete time/cost trade-off problem with discounted cash flows
- A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective
- MIP-based solution approaches for multi-site resource-constrained project scheduling
This page was built for publication: Continuous-time formulations for multi-mode project scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164343)
