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

DOI10.1504/IJOR.2005.007440MaRDI QIDQ2505325zbMATH OpenOpenAlexFDO

Authors 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

optimisationparallel computingbranch and boundresource constraintsproject managementproject scheduling

Mathematics Subject Classification ID

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

Recommendations

• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• A multiple-tree search procedure for the resource-constrained project scheduling problem
• A branch-and-bound algorithm for the resource-constrained project scheduling problem
• Resource-constrained project scheduling: A survey of recent developments.
• An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem

Cited in

(2)

• 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
• scientific article; zbMATH DE number 2009836 (Why is no real title available?)

Describes a project that uses

Uses Software

• PSPLIB

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2505325)