This research addresses a batch scheduling model for a single machine processing parts of a single item to minimize total actual flow time, defined as interval time from the arrival time to the due date. The part processing time is assumed to be increasing linearly with increasing the waiting time of the part from the batch completion time to its due date. The model consists of the following de...

Abstract In this paper, we compute the probability generating functions (PGF’s) of the customer delay for two batch-service queueing models with batch arrivals. In the first model, the available server starts a new service whenever the system is not empty (without waiting to fill the capacity), while the server waits until he can serve at full capacity in the second model. Moments can then be o...

In many queueing systems the server processes several customers simultaneously. Although the capacity of a batch, that is the number of customers that can be processed simultaneously, is often variable in practice, nearly all batch-service queueing models in literature consider a constant capacity. In this paper, we extend previous work on a batch-service queueing model with variable server cap...

In this paper, a bulk arrival general bulk service queueing model delayed service with restricted vacation policy, variant arrival rate and setup time is considered. The server starts the service only if at least ‘a’ customers are waiting in the queue, and renders the service according to the general bulk service rule with minimum of ‘a’ customers and maximum of ‘b’ customers, then the server w...

We study a queueing system having a mixture of a special semi-Markov process (SSMP) and a Poisson process as the arrival process, where the Poisson arrival is regarded as interfering traffic. It is shown by numerical examples that the SSMP customers receive worse treatment than Poisson customers, i.e., the mean waiting time of SSMP customers is longer than that of Poisson customers. We also pro...