Optimality of \(D\)-policies for an \(M\)/\(G\)/1 queue with a removable server
From MaRDI portal
Publication:1871981
DOI10.1023/A:1020989221378zbMath1013.90043OpenAlexW1596087174MaRDI QIDQ1871981
Offer Kella, Eugene A. Feinberg
Publication date: 4 May 2003
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1020989221378
Related Items (23)
Optimal design and control of queues ⋮ Queue Length Analysis of MAP/G/1 Queue UnderD-Policy ⋮ OPTIMAL CONTROL POLICIES FOR AN M/M/1 QUEUE WITH A REMOVABLE SERVER AND DYNAMIC SERVICE RATES ⋮ An optimal deterministic control policy of servers in front and back rooms with a variable number of switching points and switching costs ⋮ ON A GENERIC CLASS OF LÉVY-DRIVEN VACATION MODELS ⋮ Queue length and waiting time of the M/G/1 queue under the \(D\)-policy and multiple vacations ⋮ Equilibrium Strategies and Optimal Control for a Double-Ended Queue ⋮ Analysis of theMX/G/1 Queue UnderD-Policy ⋮ OPTIMAL SWITCHING ON AND OFF THE ENTIRE SERVICE CAPACITY OF A PARALLEL QUEUE ⋮ Queues with Delays in Two-State Strategies and Lévy Input ⋮ An Overview for Markov Decision Processes in Queues and Networks ⋮ Analysis of the MAP/G/1 Queue Under the Min(N,D)-Policy ⋮ Performance of the MAP/G/1 queue under the dyadic control of workload and server idleness ⋮ An M/G/1 Queue with Adaptable Service Speed ⋮ Optimal management of cross-trained workers in services with negligible switching costs ⋮ On the introduction of an agile, temporary workforce into a tandem queueing system ⋮ Energy-saving policies for temperature-controlled production systems with state-dependent setup times and costs ⋮ Analysis and Cost Optimization of theM/G/1 Queue Under theD-Policy and LCFS Discipline ⋮ An optimal \(P_{\lambda}^{M}\)-service policy for an \(M/G/1\) queueing system ⋮ MAP/G/1 Queue Under Workload Control and Postprocessing ⋮ An \(M/ PH /1\) queue with workload-dependent processing speed and vacations ⋮ OPTIMAL ADMISSION CONTROL IN QUEUES WITH WORKLOAD-DEPENDENT SERVICE RATES ⋮ On essential information in sequential decision processes
This page was built for publication: Optimality of \(D\)-policies for an \(M\)/\(G\)/1 queue with a removable server
