The robustness ofCAN-Qin modelling automated manufacturing systems

1 November 1986

journal article
research article
Published by Taylor & Francis in International Journal of Production Research

Vol. 24 (6) , 1485-1503
https://doi.org/10.1080/00207548608919817

Abstract

CAN-Q is a recursive algorithm for solving a closed-form stochastic model of production systems. This paper presents an investigation of the effect of departures from the assumptions underlying the analytical queueing network model on the performance predicted by CAN-Q.

Keywords

This publication has 9 references indexed in Scilit:

Robustness of queuing network formulas
Journal of the ACM, 1983
A Measurement Procedure for Queueing Network Models of Computer Systems
ACM Computing Surveys, 1978
Grouping Observations in Digital Simulation
Management Science, 1978
Network flow optimization in flexible manufacturing systems
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1978
Applications of a Queueing Network Model for a Computer System
ACM Computing Surveys, 1977
Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM, 1973
Closed Queuing Systems with Exponential Servers
Operations Research, 1967
Jobshop-Like Queueing Systems
Management Science, 1963
Networks of Waiting Lines
Operations Research, 1957