The project scheduling polyhedron: Dimension, facets and lifting theorems

DOI10.1016/0377-2217(93)90062-RMaRDI QIDQ2367366zbMATH OpenOpenAlexFDO

Authors 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) Deterministic scheduling theory in operations research (90B35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

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)

• 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
• Important classes of reactions for the proactive and reactive resource-constrained project scheduling problem
• Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
• Modeling frameworks for the multi‐skill resource‐constrained project scheduling problem: a theoretical and empirical comparison
• Robust energy planning in buildings with energy and comfort costs
• A preemptive bound for the resource constrained project scheduling problem
• Event-based MILP models for resource-constrained project scheduling problems
• The proactive and reactive resource-constrained project scheduling problem
• Integration of routing into a resource-constrained project scheduling problem
• Towards merging binary integer programming techniques with genetic algorithms
• Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
• A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations
• Project scheduling with flexible resources: formulation and inequalities
• The resource constrained project scheduling problem: a theoretical comparison between a recent formulation and the main time indexed linear programming based approaches
• Multi-mode resource constrained project scheduling problem along with contractor selection
• Branch-and-cut-and-price algorithms for the preemptive RCPSP
• Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars
• On the generation of circuits and minimal forbidden sets
• 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
• Continuous-time formulations for multi-mode project scheduling

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)