Optimal dispatching of an infinite capacity shuttle with compound Poisson arrivals: Control at a single terminal
From MaRDI portal
Publication:1317092
DOI10.1016/0305-0548(94)90063-9zbMath0790.60080OpenAlexW2042561771MaRDI QIDQ1317092
Publication date: 20 June 1994
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)90063-9
Transportation, logistics and supply chain management (90B06) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (1)
Cites Work
- Unnamed Item
- The shuttle dispatch problem with compound Poisson arrivals: Controls at two terminals
- Optimal control of bulk queues with compound Poisson arrivals and batch service
- Iterative Algorithms for Bulk Arrival, Bulk Service Queues with Poisson and Non-Poisson Arrivals
- The Computation of Optimal Control Limits for a Queue with Batch Services
- Technical Note—Further Results on an Infinite Capacity Shuttle with Control at a Single Terminal
- Optimal Dispatching of a Finite Capacity Shuttle
- Optimal Dispatching of an Infinite-Capacity Shuttle: Control at a Single Terminal
- Optimal Average Cost Policies for the Two-Terminal Shuttle
- A General Class of Bulk Queues with Poisson Input
- Optimal control of batch service queues
This page was built for publication: Optimal dispatching of an infinite capacity shuttle with compound Poisson arrivals: Control at a single terminal