The multiple resource constrained project scheduling problem: A breadth-first approach

DOI10.1016/S0377-2217(97)00402-5zbMath0938.90031OpenAlexW2010524853MaRDI QIDQ1806916

Terence Nazareth, Sanjay Verma, Subir Bhattacharya, Amitava Bagchi

Publication date: 8 November 1999

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00402-5

zbMATH Keywords

project schedulingmakespanresource constraintbreadth-first searchbest-first searchbreadth-first tree search scheme

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A polarized adaptive schedule generation scheme for the resource-constrained project scheduling problem ⋮ A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem ⋮ Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem ⋮ Minimizing total weighted late work in the resource-constrained project scheduling problem ⋮ Bicriteria train scheduling for high-speed passenger railroad planning applications

Cites Work

• Scheduling subject to resource constraints: Classification and complexity
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• New Benchmark Results for the Resource-Constrained Project Scheduling Problem
• Solving resource-constrained project scheduling problems by a* search
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems

This page was built for publication: The multiple resource constrained project scheduling problem: A breadth-first approach