Approximate Analysis of Central Server Models

DOI10.1147/RD.193.0301MaRDI QIDQ4057616zbMATH OpenOpenAlexWikidataFDO

Authors Charles H. Sauer, K. Mani Chandy

Publication date 1975

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

Full work available at URL https://semanticscholar.org/paper/81d701023f5d24bd02f9a1f4e21947760a5f6056

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(11)

• The exponentialization approach to flexible manufacturing system models with general processing times
• Maximum entropy two-station cyclic queues with multiple general servers
• Validation of a computer performance model of the exponential queuing network family
• Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines
• Optimal allocation of buffers and customers in a two-node cyclic network with multiple servers
• Predicting departure times in multi-stage queueing systems
• Probability masses Fitting in the analysis of manufacturing flow lines
• An approximation model for sojourn time distributions in acyclic multi-server queueing networks
• Multilevel aggregation of central server models: a minimum relative entropy approach
• Queueing models for a flexible machining station. II: The method of Coxian phases
• An investigation of phase-distribution moment-matching algorithms for use in queueing models

This page was built for publication: Approximate Analysis of Central Server Models

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