PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem

DOI10.1007/S001860000093zbMath1023.90028OpenAlexW2016678876MaRDI QIDQ1401645

D. Massart

Publication date: 18 August 2003

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860000093

zbMATH Keywords

branch and boundresource-constrained project scheduling

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (8)

A branch and bound algorithm for project scheduling problem with spatial resource constraints ⋮ Considering project management activities for engineering design groups ⋮ A random key based genetic algorithm for the resource constrained project scheduling problem ⋮ Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem ⋮ A heuristic solution framework for the resource constrained (multi-)project scheduling problem with sequence-dependent transfer times ⋮ PROGRESS ⋮ State-of-the-art exact and heuristic solution procedures for simple assembly line balancing

Uses Software

• PSPLIB

This page was built for publication: PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem