Continuous-time formulations for multi-mode project scheduling
From MaRDI portal
Publication:6164343
DOI10.1016/j.cor.2023.106147arXiv2301.04700OpenAlexW4317528630MaRDI QIDQ6164343
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2301.04700
network flowsresource-constrained project schedulingmixed-integer linear programmingeventsmultiple operational modes
Cites Work
- A note on ``Event-based MILP models for resource-constrained project scheduling problems
- Project scheduling with flexible resources: formulation and inequalities
- Event-based MILP models for resource-constrained project scheduling problems
- Scheduling subject to resource constraints: Classification and complexity
- On the measurement of complexity in activity networks
- On the use of the complexity index as a measure of complexity in activity networks
- PSPLIB -- a project scheduling problem library
- Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
- Insertion techniques for static and dynamic resource-constrained project scheduling.
- On the strength of time-indexed formulations for the resource-constrained project scheduling problem
- Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- A polyhedral study of event-based models for the resource-constrained project scheduling problem
- An updated survey of variants and extensions 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
- The project scheduling polyhedron: Dimension, facets and lifting theorems
- Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem
- Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
- 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
- JGraphT—A Java Library for Graph Data Structures and Algorithms
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem
This page was built for publication: Continuous-time formulations for multi-mode project scheduling