Priority queues with semiexhaustive service and class-dependent setup times.

DOI10.1016/S0895-7177(00)00089-3MaRDI QIDQ1597084zbMATH OpenFDO

Authors R. Smith

Publication date 5 May 2002

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0895-7177(00)00089-3

Mathematics Subject Classification ID

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

Recommendations

• Priority queues with semi-exhaustive service
• Waiting times in queues with relative priorities
• Priority Queues with Setup Times
• Virtual waiting times in priority-\(M/G/1\) queues with vacations
• Waiting time analysis for \(\text{M}^X/\text{G}/1\) priority queues with/without vacations under random order of service discipline

Cites work

• A note on conservation laws for a multi-class service queueing system with setup times
• scientific article; zbMATH DE number 4041013 (Why is no real title available?)
• scientific article; zbMATH DE number 49989 (Why is no real title available?)
• Priority queues
• Priority queues with semi-exhaustive service
• Priority Queues with Setup Times

Cited in

(2)

• Priority queues with semi-exhaustive service
• Priority Queues with Setup Times

This page was built for publication: Priority queues with semiexhaustive service and class-dependent setup times.

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