A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity

From MaRDI portal
Publication:1592328

DOI10.1016/S0307-904X(00)00024-XzbMath0977.60094OpenAlexW2017696243MaRDI QIDQ1592328

Kuo-Hsiung Wang, Jau-Chuan Ke

Publication date: 5 July 2001

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0307-904x(00)00024-x




Related Items (27)

Design of a fuzzy finite capacity queuing model based on the degree of customer satisfaction: analysis and fuzzy optimizationSteady-state probability of the randomized server control system with second optional service, server breakdowns and startupAnalysis and computational algorithm for queues with state-dependent vacations. I: \newline \(G/M(n)/1/K\)Analysis and computational algorithm for queues with state-dependent vacations. II: \newline \(M(n)/G/1/K\)Equilibrium customer strategies in the queue with threshold policy and setup timesOn an M/G/1 queue in random environment with Min(N, V) policyAn \(M/G/1\) queue under hysteretic vacation policy with an early startup and un-reliable serverAnalytical and computational aspects of the infinite buffer single server \(N\) policy queue with batch renewal inputRandom \(N\)-policy Geo/G/1 queue with startup and closedown timesAnalysis of queue-length dependent vacations and P-limited service in \(\mathrm{BMAP}/\mathrm{G}/1/N\) systems: stationary distributions and optimal controlOptimal management of the \(N\)-policy \(M/E_{k}/1\) queuing system with a removable service station: A sensitivity investigation.A two-class parallel system with general service times of the parallel classOptimal control of an \(M/G/1/K\) queueing system with combined \(F\) policy and startup timeA recursive method for the \(F\)-policy \(G/M/1/K\) queueing system with an exponential startup timeOptimal control of the \(N\) policy M/G/1 queueing system with server breakdowns and general startup timesRelationship between randomized \(F\)-policy and randomized \(N\)-policy in discrete-time queuesHysteretic Capacity Switching for M/G/1 QueuesA discrete-time single-server queue with a modifiedN-policyBi-level control for batch arrival queues with an early startup and un-reliable serverMaximum entropy analysis to the \(N\) policy M/G/1 queueing system with server breakdowns and general startup timesOn \(M/G/1\) system under \(NT\) policies with breakdowns, startup and closedownOptimization on bicriterion policies for M/G/1 system with second optional serviceOptimal management for infinite capacityN-policy M/G/1 queue with a removable service stationA recursive method for the \(N\) policy \(G/M/1\) queueing system with finite capacityA MULTI-SERVER QUEUEING MODEL WITH MARKOVIAN ARRIVALS AND MULTIPLE THRESHOLDSMaximum entropy analysis to the \(N\) policy M/G/1 queueing system with a removable serverAvailability of a repairable retrial system with warm standby components



Cites Work


This page was built for publication: A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity