The Resource Constrained Project Scheduling Problem: A theoretical comparison between a recent formulation and the main time indexed linear programming based approaches

DOI10.1051/ro/2016036zbMath1384.90064OpenAlexW2385296372MaRDI QIDQ4603920

Massimiliano Caramia, Lucio Bianco

Publication date: 23 February 2018

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

Full work available at URL: http://www.edpsciences.org/ro

zbMATH Keywords

project schedulingmathematical modelprecedence constraintsresource constraints

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Continuous-time formulations for multi-mode project scheduling ⋮ Polyhedral Results and Branch-and-Cut for the Resource Loading Problem

Cites Work

• Scheduling of project networks
• Scheduling subject to resource constraints: Classification and complexity
• Scheduling of resource-constrained projects
• The project scheduling polyhedron: Dimension, facets and lifting theorems
• An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation

This page was built for publication: The Resource Constrained Project Scheduling Problem: A theoretical comparison between a recent formulation and the main time indexed linear programming based approaches