Cycle times in D/D/\(S\) series queues with single multi-server bottlenecks
From MaRDI portal
Publication:6544797
DOI10.1007/s10626-023-00392-wzbMath1540.90087MaRDI QIDQ6544797
Lonnie jun. Turpin, Morgan Turpin
Publication date: 27 May 2024
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Cites Work
- Unnamed Item
- A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule
- On reworks in a serial process with flexible windows of time
- The interchangeability of ·/M/1 queues in series
- Approximations for departure processes and queues in series
- Economic Order Quantity under Conditions of Permissible Delay in Payments
- A comparison of waiting time approximations in series queueing systems
- The Output of a Queuing System
- Some Inequalities in Queuing
- Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain
This page was built for publication: Cycle times in D/D/\(S\) series queues with single multi-server bottlenecks