On stochastic optimality of policies in first passage problems
From MaRDI portal
Publication:3199217
DOI10.1080/07362999008809206zbMath0713.90092OpenAlexW1979086383MaRDI QIDQ3199217
Michael N. Katehakis, Costis Melolidakis
Publication date: 1990
Published in: Stochastic Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/07362999008809206
makespanfirst passage timemulti-processor schedulinguniformization procedurefavoured statesoptimal repair of a series system
Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)
Cites Work
- Markov chain models - rarity and exponentiality
- Finite state Markovian decision processes
- Serving process with least thinking time maximizes resource utilization
- Dynamic Repair Allocation for a k−Out−of−n System Maintained by Distinguishable Repairmen
- Optimal Repair Allocation in a Series System
- Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
- Scheduling Jobs with Exponential Processing and Arrival Times on Identical Processors so as to Minimize the Expected Makespan
- Applying a New Device in the Optimization of Exponential Queuing Systems
- Optimal Repair of a Series System
This page was built for publication: On stochastic optimality of policies in first passage problems
