This paper presents a review and evaluation of a number of strategies for the control of batch queueing processes in the semiconductor manufacturing industry. Special attention is paid to policies that include real-time information about the state of the manufacturing facility, particularly the expected timing of future arrivals. The studies evaluated highlight the potential benefits that might...

For an M/G/1 processor-sharing queue with batch arrivals, Avrachenkov et al. [1] conjectured that the conditional mean sojourn time is concave. However, Kim and Kim [5] showed that this conjecture is not true in general. In this paper, we show that this conjecture is true if the service times have a hyperexponential distribution.

This paper deals with the single server queue with batch arrivals. We show that under suitable conditions the waiting time distribution of an individual customer has an asymptotically exponential expansion. For the practically important case of phase-type distributions for the interarrival time and the service time a computationally useful characterization of the amplitude factor and the decay ...

We consider a single-server priority queue with batch arrivals. We treat the head-of-the-line (HL) or preemptive-resume (PR) priority rule. Assuming that the arrival process of batches is renewal for each priority class and using the point process approach, we express the individual class queue-length distribution in terms of the waiting time and the completion time distributions. Assuming furt...

We investigate a problem of admission control and pricing in a firm which dominates the market. In the model, there is a single server with exponential service times and arrivals follow a compound Poisson process where the number of customers in a group is an arbitrary discrete random variable. Each arriving group calculates the expected return for the whole group using the waiting cost per uni...