The project scheduling polyhedron: Dimension, facets and lifting theorems

DOI10.1016/0377-2217(93)90062-RzbMath0779.90036OpenAlexW2021200478MaRDI QIDQ2367366

Ramón Alvarez-Valdés Olaguíbel, José Manuel Tamarit Goerlich

Publication date: 25 August 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90062-r

zbMATH Keywords

inequalitiespolyhedronresource constraintsproject scheduling problemprecedence relationsfacet-defining properties

Mathematics Subject Classification ID

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

Related Items (19)

Multi-mode resource constrained project scheduling problem along with contractor selection ⋮ A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations ⋮ Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars ⋮ Branch-and-Cut-and-Price algorithms for the preemptive RCPSP ⋮ Solving resource-constrained project scheduling problems: conceptual validation of FLP formulation and efficient permutation-based ABC computation ⋮ A polyhedral study of event-based models for the resource-constrained project scheduling problem ⋮ Integration of routing into a resource-constrained project scheduling problem ⋮ A preemptive bound for the resource constrained project scheduling problem ⋮ Modeling frameworks for the multi‐skill resource‐constrained project scheduling problem: a theoretical and empirical comparison ⋮ Continuous-time formulations for multi-mode project scheduling ⋮ Robust energy planning in buildings with energy and comfort costs ⋮ The Resource Constrained Project Scheduling Problem: A theoretical comparison between a recent formulation and the main time indexed linear programming based approaches ⋮ Project scheduling with flexible resources: formulation and inequalities ⋮ Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements ⋮ Important classes of reactions for the proactive and reactive resource-constrained project scheduling problem ⋮ Towards merging binary integer programming techniques with genetic algorithms ⋮ On the generation of circuits and minimal forbidden sets ⋮ Event-based MILP models for resource-constrained project scheduling problems ⋮ The proactive and reactive resource-constrained project scheduling problem

Cites Work

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

This page was built for publication: The project scheduling polyhedron: Dimension, facets and lifting theorems