Solving resource-constrained project scheduling problems by a* search
Publication:4735027
DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199002)37:1<61::AID-NAV3220370104>3.0.CO;2-S" /><61::AID-NAV3220370104>3.0.CO;2-S 10.1002/1520-6750(199002)37:1<61::AID-NAV3220370104>3.0.CO;2-SzbMath0684.90054OpenAlexW2063686912MaRDI QIDQ4735027
Publication date: 1990
Full work available at URL: https://doi.org/10.1002/1520-6750(199002)37:1<61::aid-nav3220370104>3.0.co;2-s
artificial intelligenceComputational resultsminimum makespan schedulemultiresource constrained project scheduling
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Artificial intelligence (68T99)
Related Items (12)
Cites Work
This page was built for publication: Solving resource-constrained project scheduling problems by a* search