On a paper by Christofides et al. for solving the multiple-resource constrained, single project scheduling problem

DOI10.1016/0377-2217(94)90018-3zbMath0811.90045OpenAlexW2013943119MaRDI QIDQ1331569

Sami Baroum, James H. Patterson, Kum Khiong Yang, Erik L. Demeulemeester, Willy S. Herroelen, Wendell P. III Simpson

Publication date: 17 October 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90018-3

zbMATH Keywords

networksproject managementcomputational resultsdepth-first search, branch-and-bound solution proceduremultiple-resource constrained, single project scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Resource-constrained project scheduling: A survey of recent developments. ⋮ On the use of the complexity index as a measure of complexity in activity networks ⋮ A branch and bound algorithm for the resource-constrained project scheduling problem ⋮ Optimization analysis for design and planning of multi-project programs

Cites Work

• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Scheduling of Project Networks by Job Assignment
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem

This page was built for publication: On a paper by Christofides et al. for solving the multiple-resource constrained, single project scheduling problem