A branch-and-bound algorithm for the resource-constrained project scheduling problem

DOI10.1007/s001860000091zbMath1023.90024MaRDI QIDQ1401642

Ulrich Dorndorf, Erwin Pesch, Toàn Phan-Huy

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/s001860000091

zbMATH Keywords

constraint propagation; resource-constrained project scheduling

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B35: Deterministic scheduling theory in operations research

Related Items

Scheduling and constraint propagation, A neurogenetic approach for the resource-constrained project scheduling problem, Energetic reasoning revisited: Application to parallel machine scheduling, Robust optimization models for project scheduling with resource availability cost, Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements, A constraint programming approach for the resource-constrained project scheduling problem, Theoretical aspects of multicriteria flight gate scheduling: Deterministic and fuzzy models, Justification and RCPSP: a technique that pays, A Boolean satisfiability approach to the resource-constrained project scheduling problem, A hybrid genetic algorithm for the resource-constrained project scheduling problem, Project selection, scheduling and resource allocation with time dependent returns, A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS