The project scheduling polyhedron: Dimension, facets and lifting theorems

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Cites Work

Maximal Flow Through a Network
Scheduling subject to resource constraints: Classification and complexity
Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
Lifting the facets of zero–one polytopes
Technical Note—Facets and Strong Valid Inequalities for Integer Programs
Technical Note—A Note on Zero-One Programming
On the facial structure of scheduling polyhedra

Cited In (21)

The Resource Constrained Project Scheduling Problem: A theoretical comparison between a recent formulation and the main time indexed linear programming based approaches
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
Branch-and-Cut-and-Price algorithms for the preemptive RCPSP
Robust energy planning in buildings with energy and comfort costs
Project scheduling with flexible resources: formulation and inequalities
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
Towards merging binary integer programming techniques with genetic algorithms
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
A polyhedral study of event-based models for the resource-constrained project scheduling problem
Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
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
The proactive and reactive resource-constrained project scheduling problem

   Recommendations

Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements 👍 👎
On the facial structure of scheduling polyhedra 👍 👎
Title not available (Why is that?) 👍 👎
An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation 👍 👎

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)