The project scheduling polyhedron: Dimension, facets and lifting theorems
From MaRDI portal
(Redirected from Publication:2367366)
Recommendations
- Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
- On the facial structure of scheduling polyhedra
- scientific article; zbMATH DE number 4170623
- An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
Cites work
- Lifting the facets of zero–one polytopes
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- Maximal Flow Through a Network
- On the facial structure of scheduling polyhedra
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Scheduling subject to resource constraints: Classification and complexity
- Technical Note—A Note on Zero-One Programming
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
Cited in
(22)- Integration of routing into a resource-constrained project scheduling problem
- Important classes of reactions for the proactive and reactive resource-constrained project scheduling problem
- A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations
- Robust energy planning in buildings with energy and comfort costs
- Project scheduling with flexible resources: formulation and inequalities
- Towards merging binary integer programming techniques with genetic algorithms
- A stochastic bi-objective project scheduling model under failure of activities
- Large neighborhood search for an aeronautical assembly line time-constrained scheduling problem with multiple modes and a resource leveling objective
- Event-based MILP models for resource-constrained project scheduling problems
- On the generation of circuits and minimal forbidden sets
- Modeling frameworks for the multi‐skill resource‐constrained project scheduling problem: a theoretical and empirical comparison
- Multi-mode resource constrained project scheduling problem along with contractor selection
- A preemptive bound for the resource constrained project scheduling problem
- Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars
- Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
- A polyhedral study of event-based models for the resource-constrained project scheduling problem
- The resource constrained project scheduling problem: a theoretical comparison between a recent formulation and the main time indexed linear programming based approaches
- Solving resource-constrained project scheduling problems: conceptual validation of FLP formulation and efficient permutation-based ABC computation
- Continuous-time formulations for multi-mode project scheduling
- Branch-and-cut-and-price algorithms for the preemptive RCPSP
- Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
- The proactive and reactive resource-constrained project scheduling problem
This page was built for publication: The project scheduling polyhedron: Dimension, facets and lifting theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367366)
