Scheduling tasks with failure probabilities to minimize expected cost

DOI10.1002/1520-6750(199002)37:1%3C99::AID-NAV3220370106%3E3.0.CO;2-5MaRDI QIDQ4735026zbMATH OpenOpenAlexFDO

Authors Mordecai Henig, David Simchi-Levi

Publication date 1990

Full work available at URL https://doi.org/10.1002/1520-6750(199002)37:1%3C99::aid-nav3220370106%3E3.0.co;2-5

zbMATH Keywords

expected discounted profitfailure probabilityNP- completeperformance cost

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• Selecting jobs for scheduling on a machine subject to failure
• Scheduling projects with stochastic activity duration to maximize expected net present value
• Probabilistic single processor scheduling
• Optimal scheduling of random works with reliability application
• Scheduling modular projects on a bottleneck resource

Cited in

(3)

• Failure probability analysis on scheduling rule with exponentially distributed processing time
• Scheduling modular projects on a bottleneck resource
• Probabilistic single processor scheduling

This page was built for publication: Scheduling tasks with failure probabilities to minimize expected cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4735026)