Computational procedures for steady-state characteristics of unscheduled multi-carrier shuttle systems
DOI10.1016/0377-2217(83)90223-0zbMath0499.90036OpenAlexW2076854602MaRDI QIDQ1171990
Publication date: 1983
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(83)90223-0
waiting time distributionstransportation systemsteady-state characteristicsoptimal fleet sizecomputational proceduresPoisson arrival processsystem performance measuresdispatching policyindependent and identically distributed random trip timesno capacity constraintpassenger queue lengthunscheduled multi-carrier shuttle systems
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (7)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Steady state results for the M/M(a,b)/c batch-service system
- Stochastic clearing systems
- The Computation of Optimal Control Limits for a Queue with Batch Services
- Queues Solvable without Rouché's Theorem
- The Stationary Distribution of a Stochastic Clearing Process
- A Multiserver Queue with Thresholds for the Acceptance of Customers into Service
- Waiting Time Distribution in a Poisson Queue with a General Bulk Service Rule
- Analytically Explicit Results for the Queueing System M/Mx/C with Charts and Tables for Certain Measures of Efficiency
- Optimal dispatching strategies for vehicles having exponentially distributed trip times
- Letter to the Editor—Multichannel Queuing System with Bulk Service
- A General Class of Bulk Queues with Poisson Input
- Steady-State Solution of the Queuing System Eu/M/s with Batch Service
- A Many Server Bulk Queue
- Optimal control of batch service queues
This page was built for publication: Computational procedures for steady-state characteristics of unscheduled multi-carrier shuttle systems