Optimal Scheduling of Exponential Tasks with In-Tree Precedence Constraints on Two Parallel Processors Subject to Failure and Repair

DOI10.1287/opre.40.3.S263zbMath0764.90048OpenAlexW2057233024MaRDI QIDQ4016951

Vidyadhar G. Kulkarni, P. F. Jun. Chimento

Publication date: 16 January 1993

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.40.3.s263

zbMATH Keywords

failureprecedence constraintsrepairin-treetwo processorsstochastic partial ordering

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25) Stochastic systems in control theory (general) (93E03)

Related Items (2)

Optimal Scheduling on Parallel Processors with Precedence Constraints and General Costs ⋮ Single-machine scheduling of stochastic jobs subject to deterioration or delay

This page was built for publication: Optimal Scheduling of Exponential Tasks with In-Tree Precedence Constraints on Two Parallel Processors Subject to Failure and Repair