Flow Polyhedra and Resource Constrained Project Scheduling Problems

DOI10.1051/ro/2012021zbMath1262.90068OpenAlexW2110774797MaRDI QIDQ4917226

Hélène Toussaint, Alain Quilliot

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

scheduling with resource constraintsnetwork flow theory

Mathematics Subject Classification ID

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

Related Items (1)

An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration

This page was built for publication: Flow Polyhedra and Resource Constrained Project Scheduling Problems