Optimization of tandem queue systems with finite buffers

We consider the problem of optimizing the mean processing rate in a tandem queue system (TQS), where items enter in a fixed order. Stations in the TQS are selected and optimized so as to reduce the mean processing time of an item in the system. The concept of critical path is introduced, with which a PA method is presented. In order to reduce the number of items in a simulation, regenerative properties are discussed for the TQS so that the steady performance measure can be obtained in a regenerative cycle. Furthermore, through a simulation in a regenerative cycle, the stations that should be optimized are identified, and the optimal decision to improve these stations is determined by introducing slack degree.