An Approximate Method for Treating a Class of Multiqueue Problems

DOI10.1147/RD.53.0204MaRDI QIDQ5727107zbMATH OpenOpenAlexFDO

Authors M. A. Leibowitz

Publication date 1961

Published in IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1147/rd.53.0204

zbMATH Keywords

probability theory

Mathematics Subject Classification ID

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

Cited in

(9)

• Symmetric queues served in cyclic order
• A production system with two job classes, changeover times and revisitation
• Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines
• scientific article; zbMATH DE number 715269 (Why is no real title available?)
• Interval Coverage in Multiclass Queues Using Batch Mean Estimates
• A unifying framework for the approximate solution of closed multiclass queuing networks
• A Sweep Method for Calculating Multichannel Queueing Systems
• Comparing an approximate queuing approach with simulation for the solution of a cross-docking problem
• Cyclic service queues with very short service times

This page was built for publication: An Approximate Method for Treating a Class of Multiqueue Problems

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