A multiple-tree search procedure for the resource-constrained project scheduling problem

DOI10.1016/0377-2217(94)00247-9zbMath0915.90153OpenAlexW2061571733MaRDI QIDQ1266726

Wendell P. III Simpson, James H. Patterson

Publication date: 7 October 1998

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)00247-9

zbMATH Keywords

project schedulingproject managementlimited resource availabilitymultiple parallel processorsmultiple resource constraintsmultiple-tree search procedure

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Parallel numerical computation (65Y05)

Related Items

Resource-constrained project scheduling: A survey of recent developments., Using metaheuristics in multiobjective resource constrained project scheduling, Tabu search in audit scheduling

Cites Work

• A two-process implicit enumeration algorithm for the simple assembly line balancing problem
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Anomalies in parallel branch-and-bound algorithms
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• A Horizon-Varying, Zero-One Approach to Project Scheduling
• An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
• An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey