On non-preemptive strategies for stochastic scheduling problems in continuous time

DOI10.1080/00207728108963782zbMath0456.90041OpenAlexW2071413338MaRDI QIDQ3905051

Kevin D. Glazebrook

Publication date: 1981

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207728108963782

zbMATH Keywords

algorithmssingle machineexistence of optimal strategiesnon-preemptive strategiesminimization of expected costsstochastic scheduling in continuous time

Mathematics Subject Classification ID

Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35)

Related Items

A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering

Cites Work

• Generalized semi-Markov decision processes
• Unnamed Item
• Unnamed Item