For a superposition of i.i.d. renewal processes we derive in closed form the limiting distribution of an embedded counting process that describes the simultaneous presence of points from the individual renewal streams in consecutive inspection intervals of fixed given length.

In this paper, we consider a single-server infinite capacity queue with Poisson arrival. The server takes all waiting customers as a batch into service, and the service time of the kth customer in a batch is a + b × k, where a and b are the set-up time and the individual service time for each...

This paper is concerned with the optimal control of a bulk service queueing system under N-policy. If the number of customers in the system at a service completion is larger than some integer r, then the server starts processing a group of r customers. If, on the other hand, it is smaller than...