Buffer requirements and server ordering in a tandem queue with correlated service times

Mathematics of Operations Research

Volumn 26, Issue 2, 2001, Pages 358-374

  Avi Itzhak, B ^a   Levy, H ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Buffer; Queuing; Tandem queues

Indexed keywords

ARCHITECTURAL DESIGN; COMPUTATIONAL COMPLEXITY; JUST IN TIME PRODUCTION; QUEUEING THEORY; SERVERS;

SERVER ORDERING;

OPERATIONS RESEARCH;

EID: 0035351623     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.26.2.358.10556     Document Type: Article

References (14)

1. A sequence of service stations with arbitrary input and regular service times
2. Servers in tandem with communication and manufacturing blocking
3. A sequence of servers with arbitrary input and regular service times revisited
4. Optimal order for servers in series with no queue capacity
5. Reduction methods for tandem queueing systems
6. Optimal order of M machines in tandem
7. The throughput of a series of buffers
8. Blocking, reordering, and the throughput of a series of queues
9. Segregating the input of a series of buffers
10. Ordering of tandem constant-service stations to minimize in-process stock cost
11. On the optimal order of stations in tandem queues
12. The best order of queues in series
13. On optimal arrangement of stations in a tandem queueing system with blocking
14. Tandem queues with correlated service times and finite capacity