Buffer Requirements and Server Ordering in a Tandem Queue with Correlated Service Times
Published Online:1 May 2001https://doi.org/10.1287/moor.26.2.358.10556
References
- A sequence of service stations with arbitrary input and regular service times. Management Sci. (1965) 11:565–571Link, Google Scholar
- Servers in tandem with communication and manufacturing blocking. J. Appl. Probab. (1993) 31:1061–1069Crossref, Google Scholar
- A sequence of servers with arbitrary input and regular service times revisited. Management Sci. (1995) 41:1039–1048Link, Google Scholar
- Optimal order for servers in series with no queue capacity. Probab. Engrg. Inform. Sci. (1991) 5:449–461Crossref, Google Scholar
- Reduction methods for tandem queueing systems. Oper. Res. (1965) 13:121–131Link, Google Scholar
- Optimal order of M machines in tandem. Oper. Res. Lett. (1988) 9:299–303Crossref, Google Scholar
- The throughput of a series of buffers. Adv. Appl. Probab. (1982) 14:633–653Crossref, Google Scholar
- Blocking, reordering, and the throughput of a series of queues. Stochastic Proc. Appl. (1984) 17:327–336Crossref, Google Scholar
- Segregating the input of a series of buffers. Math. Oper. Res. (1985) 10:33–43Link, Google Scholar
- Ordering of tandem constant-service stations to minimize in-process stock cost. Probab. Engrg. Inform. Sci. (1995) 9:457–473Crossref, Google Scholar
- On the optimal order of stations in tandem queues. Appl. Probab.-Comput. Sci.: The Interface (1982) II(Birk Houser, Boston, MA) 307–325Crossref, Google Scholar
- The best order of queues in series. Management Sci. (1985) 31:475–487Link, Google Scholar
- On optimal arrangement of stations in a tandem queueing system with blocking. Management Sci. (1992) 38:137–153Link, Google Scholar
- Tandem queues with correlated service times and finite capacity. Math. Oper. Res. (1993) 18:901–915Link, Google Scholar

