A cyclic-service finite source model with round-robin scheduling

DOI10.1007/BF01159289zbMath0752.60085OpenAlexW2034880016MaRDI QIDQ1193788

Tetsuya Takine, Toshiharu Hasegawa

Publication date: 27 September 1992

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01159289

zbMATH Keywords

Laplace-Stieltjes transformround-robin schedulingfinite source model

Mathematics Subject Classification ID

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

Related Items

Mathematical methods to study the polling systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A model for a textile winding process
• A Numerical Method to Obtain the Equilibrium Results for the Multiple Finite Source Priority Queueing Model
• A machine interference problem with multiple types of failures
• Queuing analysis of polling models
• A Numerical Approach to the Repairman Problem with Two Different Types of Machine
• The Machine Repair Problem with Heterogeneous Populations
• A Finite-Source Queue with Different Customers
• Analysis of a Loop Transmission System with Round-Robin Scheduling of Services
• Chaining in a Loop System
• Finite-Source Priority Queues
• Modeling And Analysis Of A Single-Buffer Polling System Interconnected With External Networks

This page was built for publication: A cyclic-service finite source model with round-robin scheduling