Resource portfolio problem under relaxed resource dedication policy in multi-mode multi-project scheduling

zbMath1452.90165MaRDI QIDQ2205063

Gündüz Ulusoy, Ümit Bilge, Umut Besikci

Publication date: 20 October 2020

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

zbMATH Keywords

branch and cutmulti-mode resource constrained multi-project schedulingresource dedicationresource portfolio allocation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Uses Software

• CPLEX

This page was built for publication: Resource portfolio problem under relaxed resource dedication policy in multi-mode multi-project scheduling