Untitled

Abstract

Traditionally, studies on tandem queueing networks concentrate on systems with infinite buffers, exponential service times, and/or single servers where solutions are more tractable. Less research can be found on more general, less tractable systems. We examine multipleserver systems with finite buffers and non-exponential service times, studying the effects of coefficient of variation (cv) of the service-time distribution on the throughput of these systems, where cv differs among stations.Starting with the single station, we examine the effects of cv and the number of servers at the station on the distribution of interdeparture times. This insight helps explain the differences in throughput seen in the single (fast) server vs. multiple (slow) server problem. These results, in turn, shed light on the server allocation problem when cv differs among stations. We present some observations, as well as the intuition behind them.

Influence of unbalanced operation time means and uneven buffer allocation on unreliable merging assembly line efficiency

“…They also noted that for any set of parameters maximising TR, the 'bowl phenomenon' holds true. Futamura (2000) studied optimal allocation of servers to serial queueing networks with unbalanced MTs, coefficients of variation and BCs, which showed a general interaction between the CV of the service time distribution and stations' number of servers. Leung and Lai (2005) considered the assignment of parallel workstations to improve cycle times when compared to simple assembly systems.…”