Single Machine Scheduling Problem When the Machine Capacity Varies Stochastically

DOI10.1287/OPRE.40.2.376MaRDI QIDQ4004744zbMATH OpenOpenAlexFDO

Authors Tetsuji Hirayama, Masaaki Kijima

Publication date 27 September 1992

Published in Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

machine breakdown modelssimple priority rulessingle machine schedulingstochastic machine capacity

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Stochastic systems in control theory (general) (93E03)

Recommendations

• On stochastic machine scheduling with general distributional assumptions
• Optimal rules for single machine scheduling with stochastic breakdowns
• Optimal scheduling in a machine with stochastic varying processing rate
• A stochastic single machine scheduling with random processing time
• Single-machine scheduling subject to stochastic breakdowns

Cited in

(7)

• Bounds on optimal values in stochastic scheduling
• Stochastic single machine scheduling problem as a multi-stage dynamic random decision process
• Streaming algorithms for multitasking scheduling with shared processing
• Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
• Optimal scheduling in a machine with stochastic varying processing rate
• Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity
• SRPT applied to bandwidth-sharing networks

This page was built for publication: Single Machine Scheduling Problem When the Machine Capacity Varies Stochastically

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