PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem
From MaRDI portal
Publication:1401645
DOI10.1007/s001860000093zbMath1023.90028OpenAlexW2016678876MaRDI QIDQ1401645
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items
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
