Approximate queueing formulae are often employed for the practical evaluation of manufacturing system performance.
I. INTRODUCTIONQueueing, or waiting in line for an available server, is a common phenomenon in many industries including computing, manufacturing and customer service and has been studied for perhaps 100 years (Erlang published his first paper on queueing theory in 1909, [1]). Simple closed form approximation formulae for the mean cycle time behavior of the G/G/m queue (potentially subject to server failures) have been developed and employed over the course of decades to predict, understand and plan for manufacturing system behavior, see as a start [2,3,4] and the references contained therein. Rough cut approximations have been employed, as in [5], in the performance evaluation of networks of queues by the use of approximate coupling formulae intended to capture the interaction between the arrival and departure processes within the network. Approximations are often used in lieu of exact numerical procedures or performance bounds. The intuitive value of simple expressions for system performance coupled with their ease of use has resulted in their ascendance as the primary tool for understanding cycle time behavior in IBM's 200mm semiconductor wafer fabricator. Much work has been devoted to successfully bridging the gap between measures of actual system performance and the predictions obtained from the M/D/1 (or the more generic G/G/m) queue [6,7,8,9,10,11].