Optimal service assignment in a finite-source queue

DOI10.1109/9.8650MaRDI QIDQ3826340zbMATH OpenOpenAlexFDO

Authors Tetsuji Hirayama

Publication date 1989

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/9.8650

zbMATH Keywords

dynamic schedulingexpected present value of rewardsfinite-source M/M/1 systemindex policyinfinite planning horizonpreemptive service assignment policyseveral types of customers

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Optimal server allocation in general, finite, multi-server queueing networks
• Optimal Server Allocation to Parallel Queues with Finite-Capacity Buffers
• Optimal server scheduling in nonpreemptive finite-population queueing systems
• Optimal arrangements of queuing systems with FIFO service discipline
• scientific article; zbMATH DE number 65357
• Optimal allocation of a server between two queues with due times
• Optimal server assignment in a two-stage tandem queueing system
• Optimal allocation of service rates in Jackson network of queues with total finite accommodating space
• Server assignment policies for maximizing the steady-state throughput of finite queueing systems

Cited in

(8)

• Analysis of a finite-source customer assignment model with no state information
• Realizable Performance Vectors of a Finite-Source Queue
• Optimal allocation of service rates in Jackson network of queues with total finite accommodating space
• scientific article; zbMATH DE number 3941236 (Why is no real title available?)
• scientific article; zbMATH DE number 4100921 (Why is no real title available?)
• Technical Note—On Rothkopf and Smith's Statement Regarding Optimal Priority Assignment
• Optimal Allocation of Two Fixed Service Units Acting as M/G/1 Queues
• Optimal server scheduling in nonpreemptive finite-population queueing systems

This page was built for publication: Optimal service assignment in a finite-source queue

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