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

DOI10.1016/0167-6911(93)90065-EzbMATH Open0769.90038OpenAlexW1977201373MaRDI QIDQ1803850FDOQ1803850

Authors: 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

Recommendations

• The cμ rule revisited
• Optimal Routing of Customers to Two Parallel Heterogeneous Servers: The Case of IHR Service Times
• On the Assignment of Customers to Parallel Queues
• Managing Queues with Heterogeneous Servers
• On a Slow Server Problem

zbMATH Keywords

dynamic programmingphase-type distributionsstochastic schedulingmonotone 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

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

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Optimal server assignment in the case of service times with monotone failure rates

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