Optimal server assignment in the case of service times with monotone failure rates

DOI10.1016/0167-6911(93)90065-EzbMath0769.90038OpenAlexW1977201373MaRDI QIDQ1803850

Ger Koole

Publication date: 29 June 1993

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6911(93)90065-e

zbMATH Keywords

dynamic programmingstochastic schedulingphase-type distributionsmonotone failure rate\(\mu c\)-ruleoptimal policy for service time distributions

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Reliability, availability, maintenance, inspection in operations research (90B25) Dynamic programming (90C39)

Cites Work

• Interchange arguments for classical scheduling problems in queues
• Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
• Stochastic inequalities for an overflow model
• On the optimality of LEPT and μc rules for parallel processors and dependent arrival processes
• Marked point processes as limits of Markovian arrival streams
• Unnamed Item
• Unnamed Item
• Unnamed Item