Realizable Performance Vectors of a Finite-Source Queue

DOI10.1287/OPRE.32.6.1358MaRDI QIDQ3220324zbMATH OpenOpenAlexFDO

Authors Hisao Kameda

Publication date 1984

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.32.6.1358

zbMATH Keywords

finite-source queueing modelinfinite-serversingle-servertwo-stage closed Markovian cyclic queue

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Recommendations

• Characterization and Optimization of Achievable Performance in General Queueing Systems
• Optimal service assignment in a finite-source queue
• NONPREEMPTIVE SCHEDULING OF A FINITE-SOURCE QUEUE WITH TWO CUSTOMER CLASSES
• A Study of Multiple Finite-Source Queueing Models
• Queueing and scheduling in random environments

Cited in

(2)

• A cyclic-service finite source model with round-robin scheduling
• Heterogeneous multiprocessor systems with breakdowns: Performance and optimal repair strategies

This page was built for publication: Realizable Performance Vectors of a Finite-Source Queue

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