The resource constrained project scheduling problem with multiple crashable modes: An exact solution method
DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(200103)48:2<107::AID-NAV1>3.0.CO;2-9" /><107::AID-NAV1>3.0.CO;2-9 10.1002/1520-6750(200103)48:2<107::AID-NAV1>3.0.CO;2-9zbMath0981.90021OpenAlexW1969585181MaRDI QIDQ2726429
Daniel G. Conway, Taeho Ahn, S. Selcuk Erenguc
Publication date: 3 April 2002
Full work available at URL: https://doi.org/10.1002/1520-6750(200103)48:2<107::aid-nav1>3.0.co;2-9
branch and boundmulti-modemultiple crashing modesnonpreemptive resource constrained project scheduling problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (10)
Cites Work
This page was built for publication: The resource constrained project scheduling problem with multiple crashable modes: An exact solution method