Cycle times in D/D/S series queues with single multi-server bottlenecks
From MaRDI portal
Publication:6544797
Recommendations
Cites work
- scientific article; zbMATH DE number 89668 (Why is no real title available?)
- A comparison of waiting time approximations in series queueing systems
- 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
- Economic Order Quantity under Conditions of Permissible Delay in Payments
- On reworks in a serial process with flexible windows of time
- Some Inequalities in Queuing
- Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain
- The interchangeability of ·/M/1 queues in series
- The output of a queuing system
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)