MIP-based solution approaches for multi-site resource-constrained project scheduling

DOI10.1007/s10479-022-05109-0zbMath1544.90075MaRDI QIDQ6581389

Norbert Trautmann, Tamara Bigler, Mario Gnägi

Publication date: 30 July 2024

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

zbMATH Keywords

mathematical programmingresource-constrained project schedulingmatheuristicmultiple sites

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• A flow-based tabu search algorithm for the RCPSP with transfer times
• A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags
• A heuristic solution framework for the resource constrained (multi-)project scheduling problem with sequence-dependent transfer times
• PSPLIB -- a project scheduling problem library
• Project scheduling. A research handbook.
• An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: the single mode case
• Managing and modelling general resource transfers in (multi-)project scheduling
• Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times
• A guide to vehicle routing heuristics

This page was built for publication: MIP-based solution approaches for multi-site resource-constrained project scheduling