Scheduling resource-constrained projects using branch-and-bound and parallel computing techniques

DOI10.1504/IJOR.2005.007440zbMath1100.90016OpenAlexW2044278990MaRDI QIDQ2505325

Fortunato Crespo Abril, Concepción Maroto Álvarez

Publication date: 4 October 2006

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

Full work available at URL: https://doi.org/10.1504/ijor.2005.007440

zbMATH Keywords

project schedulingbranch and boundparallel computingproject managementoptimisationresource constraints

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm

Uses Software

• Unnamed Item

This page was built for publication: Scheduling resource-constrained projects using branch-and-bound and parallel computing techniques