Single server cyclic service queueing model with bulk arrival
In a system with \(N\)-policy, the server becomes unavailable when there are no customers in the system and becomes available again when \(N\) customers have accumulated in the system, where \(N\) is a constant positive integer. Another policy considered in the paper is the \(T\)-policy, which is equivalent to the multiple vacation model with constant length vacations. The paper deals with the cyclic service bulk arrival queueing model under \(T\)-policy and \(N\)-policy schedules. The expressions for average waiting time, average cyclic time and penalty rate are derived when service times are sufficiently less than that of inter-arrival times.
- A single server queue with cyclically indexed arrival and service rates
- A multi-class cyclic arrival queue with a single server
- An approximation method for a single server queue with cyclically indexed arrival and service rates
- scientific article; zbMATH DE number 1212789
- A queueing network with a single cyclically roving server
- A numerical approach to cyclic-service queueing models
- A queueing model with the bulk arrival rate depending upon the nature of service
- scientific article; zbMATH DE number 3881634
- scientific article; zbMATH DE number 2189943
This page was built for publication: Single server cyclic service queueing model with bulk arrival
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q874859)
