Scheduling tasks with failure probabilities to minimize expected cost
From MaRDI portal
Publication:4735026
DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199002)37:1<99::AID-NAV3220370106>3.0.CO;2-5" /><99::AID-NAV3220370106>3.0.CO;2-5 10.1002/1520-6750(199002)37:1<99::AID-NAV3220370106>3.0.CO;2-5zbMath0684.90053OpenAlexW2013899899MaRDI QIDQ4735026
David Simchi-Levi, Mordechai I. Henig
Publication date: 1990
Full work available at URL: https://doi.org/10.1002/1520-6750(199002)37:1<99::aid-nav3220370106>3.0.co;2-5
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
This page was built for publication: Scheduling tasks with failure probabilities to minimize expected cost