Multiple finite source queueing model with dynamic priority scheduling

DOI10.1002/nav.3800370303zbMath0694.90051OpenAlexW1596244944MaRDI QIDQ3470235

Phadhana Tosirisuk, Jeya Chandra

Publication date: 1990

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800370303

zbMATH Keywords

dynamicrecursive algorithmsingle servermean waiting timeapproximate valuesmean number of waiting customersmultiple finite source queueingnonpreemtive priority service discipline

Mathematics Subject Classification ID

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

Related Items

A multi-echelon queueing model with dynamic priority scheduling ⋮ A survey of the machine interference problem ⋮ Asymptotic analysis of the heterogeneous machine interference problem with random environments

Cites Work

• The correction terms in approximate mean value analysis
• Queues with Dynamic Priority Discipline
• On a machine interference problem with several types of machines attended by a single repairman
• A Study of Multiple Finite-Source Queueing Models
• Mean-Value Analysis of Closed Multichain Queuing Networks
• A Dynamic Priority Queue with General Concave Priority Functions
• An Iterative Algorithm for a Multiple Finite-source Queueing Model with Dynamic Priority Scheduling
• Finite-Source Priority Queues
• Bounds for a Dynamic-Priority Queue
• Some problems in queueing with dynamic priorities
• Waiting‐time distributions for queues with dynamic priorities