Problem space search algorithms for resource-constrained project scheduling

DOI10.1023/A:1018982423325zbMath0893.90093OpenAlexW73466379MaRDI QIDQ1374443

Robert H. Storer, S. David Wu, Kedar S. Naphade

Publication date: 16 August 1998

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018982423325

zbMATH Keywords

resource-constrained project schedulinglocal search metaheuristicproblem space search heuristics

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)

Related Items (11)

Experimental investigation of heuristics for resource-constrained project scheduling: an update ⋮ Metaheuristics: A bibliography ⋮ Lagrangian relaxation guided problem space search heuristics for generalized assignment problems ⋮ Resource-constrained project scheduling: A critical activity reordering heuristic ⋮ Order-based neighborhoods for project scheduling with nonregular objective functions. ⋮ Problem space search metaheuristics with fix and optimize approach for the integrated fleet sizing and replenishment planning problem ⋮ Solving the resource-constrained project scheduling problem by a variable neighbourhood search. ⋮ Revenue sharing for resource reallocation among project activity contractors ⋮ Case-based reasoning and improved adaptive search for project scheduling ⋮ PSPLIB -- a project scheduling problem library ⋮ Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem

This page was built for publication: Problem space search algorithms for resource-constrained project scheduling