An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem

DOI10.1007/s10479-023-05775-8zbMath1545.90066MaRDI QIDQ6588464

Amir Salehipour, Leila Moslemi Naeni, Alireza Etminaniesfahani, Han-Yu Gu

Publication date: 15 August 2024

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

zbMATH Keywords

constraint programmingmatheuristicrelax-and-solvemulti-mode resource constrained project scheduling problemrolling time window

Mathematics Subject Classification ID

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

This page was built for publication: An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem