An efficient algorithm for the multi-mode resource constrained project scheduling problem with resource flexibility

DOI10.1504/IJMOR.2010.035497zbMath1198.90201OpenAlexW1993116207MaRDI QIDQ606604

Najib M. Najid, Marouane Arroub

Publication date: 17 November 2010

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

Full work available at URL: https://doi.org/10.1504/ijmor.2010.035497

zbMATH Keywords

project schedulingtabu searchresource constrained schedulinghuman resourcesflow graphsdecomposition-based heuristicslabour skillsmulti-mode schedulingmulti-skilled labourresource limitation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Theory of organizations, manpower planning in operations research (90B70)

This page was built for publication: An efficient algorithm for the multi-mode resource constrained project scheduling problem with resource flexibility