Cycle times in D/D/S series queues with single multi-server bottlenecks
From MaRDI portal
Publication:6544797
DOI10.1007/S10626-023-00392-WzbMATH Open1540.90087MaRDI QIDQ6544797FDOQ6544797
Authors: Lonnie jun. Turpin, Morgan Turpin
Publication date: 27 May 2024
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Recommendations
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Economic Order Quantity under Conditions of Permissible Delay in Payments
- Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain
- The output of a queuing system
- A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule
- Approximations for departure processes and queues in series
- The interchangeability of ·/M/1 queues in series
- Some Inequalities in Queuing
- Title not available (Why is that?)
- A comparison of waiting time approximations in series queueing systems
- On reworks in a serial process with flexible windows of time
This page was built for publication: Cycle times in D/D/\(S\) series queues with single multi-server bottlenecks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6544797)