Flow polyhedra and resource constrained project scheduling problems

DOI10.1051/RO/2012021MaRDI QIDQ4917226zbMATH OpenOpenAlexFDO

Authors Alain Quilliot, Hélène Toussaint

Publication date 29 April 2013

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/8c645ff4e27912ae229bc67c6fcd0223d5298dcd

zbMATH Keywords

network flow theoryscheduling with resource constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Insertion techniques for static and dynamic resource-constrained project scheduling.
• Complex Scheduling
• scientific article; zbMATH DE number 1175395
• Solving project scheduling problems by minimum cut computations
• Scheduling and constraint propagation

Cited in

(4)

• On the integration of diverging material flows into resource-constrained project scheduling
• Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources
• An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration
• Scheduling projects with converging and diverging material flows using IBM ILOG CP optimizer -- an experimental performance analysis

This page was built for publication: Flow polyhedra and resource constrained project scheduling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4917226)