Deterministic and sampling heuristic algorithms for project scheduling with resource constraints

MaRDI QIDQ5323389zbMATH OpenFDO

Authors Ramón Alvarez-Valdés Olaguíbel, José Manuel Tamarit Goerlich

Publication date 23 July 2009

Full work available at URL https://eudml.org/doc/40158, http://www.idescat.cat/sort/questiio/questiiopdf/13.1,2,3.11.alvarez.pdf

zbMATH Keywords

heuristicnonparametric testsproject scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
• A comparative study of computational procedures for the resource constrained project scheduling problem
• Project scheduling under limited resources. Models, methods, and applications
• scientific article; zbMATH DE number 4051338
• Heuristics for resource-constrained scheduling†

Cited in

(3)

• Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
• Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
• Solving project scheduling problems with a heuristic learning algorithm

This page was built for publication: Deterministic and sampling heuristic algorithms for project scheduling with resource constraints

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