The exponentialization approach to flexible manufacturing system models with general processing times

Abstract Recently flexible manufacturing systems (FMSs) have been modelled as closed networks of queues. In this paper we develop an exponentialization approach to the modeling of FMS networks with general processing times. The idea of the approach is to transform the network into an (approximately) equivalent exponential network, where each station has exponential processing times with state-dependent rates. The approach is formulated as a fixed-point problem. Numerical examples have indicated excellent accuracies of the approach. This approach can also be readily adapted to accommodate limited local buffers and dynamic parts routing.

[1]  W. J. Gordon,et al.  Closed Queuing Systems with Exponential Servers , 1967, Oper. Res..

[2]  Didier Dubois,et al.  Heuristic methods based on mean-value analysis for flexible manufacturing systems performance evaluation , 1982, 1982 21st IEEE Conference on Decision and Control.

[3]  Martin Reiser,et al.  Mean-value analysis and convolution method for queue-dependent servers in closed queueing networks , 1981, Perform. Evaluation.

[4]  K. Mani Chandy,et al.  Approximate Analysis of Central Server Models , 1975, IBM J. Res. Dev..

[5]  Peter J. Denning,et al.  The Operational Analysis of Queueing Network Models , 1978, CSUR.

[6]  J. A. Buzacott,et al.  Modelling the performance of flexible manufacturing systems , 1985 .

[7]  David D. Yao,et al.  Modeling a class of state-dependent routing in flexible manufacturing systems , 1985 .

[8]  Yves Dallery,et al.  A new approach based on operational analysis for flexible manufacturing systems performance evaluation , 1983, The 22nd IEEE Conference on Decision and Control.

[9]  Rajan Suri,et al.  Robustness of queuing network formulas , 1983, JACM.

[10]  W. Whitt,et al.  The Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[11]  J. A. Buzacott,et al.  Queueing models for a flexible machining station Part I: The diffusion approximation , 1985 .

[12]  M. Reiser,et al.  A Queueing Network Analysis of Computer Communication Networks with Window Flow Control , 1979, IEEE Trans. Commun..

[13]  J. A. Buzacott,et al.  Queueing models for a flexible machining station Part II: The method of Coxian phases , 1985 .

[14]  W. Whitt,et al.  Open and closed models for networks of queues , 1984, AT&T Bell Laboratories Technical Journal.

[15]  J. G. Shanthikumar,et al.  Heuristic analysis of closed queueing networks , 1983 .

[16]  R. Kellogg,et al.  Pathways to solutions, fixed points, and equilibria , 1983 .

[17]  Raymond A. Marie.  An Approximate Analytical Method for General Queueing Networks , 1979, IEEE Transactions on Software Engineering.

[18]  K. Mani Chandy,et al.  Approximate Analysis of General Queuing Networks , 1975, IBM J. Res. Dev..

[19]  Gianfranco Balbo,et al.  Computational algorithms for closed queueing networks , 1980 .