Article

On M[x]G1G21 queue with optional re-service

Department of Statistics, Faculty of Science, Yarmouk University, Irbid, Jordan
Applied Mathematics and Computation (Impact Factor: 1.35). 04/2004; 152(1):71-88. DOI: 10.1016/S0096-3003(03)00545-9
Source: DBLP

ABSTRACT We study a single server queue with batch arrivals and two types of heterogeneous service with different general (arbitrary) service time distributions. The server provides either type of service to customers, one by one, on a first come, first served basis. Just before a service starts, a customer has the option to choose either type of service after completion of which the customer may leave the system or may opt for re-service of the service taken by him. We obtain steady-state results in explicit and closed form in terms of the probability generating functions for the number of customers in the queue and the system, the average number of customers and the average waiting time in the queue as well as the system. Some special cases of interest are discussed and some known results have been derived. A numerical illustration is provided.

0 Bookmarks
 · 
128 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper deals with the steady state analysis of batch arrival retrial queueing system with two types of service under modified vacation policy, where each type consists of an optional re-service. An arriving batch may balk the system at some particular times. After the completion of each types of service the customers may re-service of the same type without joining the orbit or may leave the system. If the orbit is empty at the service completion of each types of service, the server takes at most J vacations until at least one customer is received in the orbit when the server returns from a vacation. Busy server may breakdown at any instance and the service channel will fail for a short interval of time. The steady state probability generating function for system/orbit size is obtained by using the supplementary variable method. Some system performance measures and numerical illustrations are discussed.
    09/2014; DOI:10.1016/j.asej.2014.02.003
  • [Show abstract] [Hide abstract]
    ABSTRACT: We study the production time allocation issue for a multi-purpose manufacturing facility. This production facility can produce different types of make-to-order and make-to-stock products. Using a vacation queueing model, we develop a set of quantitative performance measures for a two-parameter time allocation policy. Based on the renewal cycle analysis, we derive an average cost expression and propose a search algorithm to find the optimal time allocation policy that minimizes the average cost. Some numerical examples are presented to demonstrate the effectiveness of the search algorithm. The vacation model used in this paper is also a generalization of some previous vacation queueing models in the literature. The results obtained in this study are useful for production managers to design an operating policy in practice.
    Journal of Industrial and Management Optimization 02/2011; 7(1). DOI:10.3934/jimo.2011.7.19 · 0.60 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we use the maximum entropy principle(MEP) to find the approximate waiting time of an M X /G/1 model with 'k' services; the first being essential (first essential service FES) whereas remaining 'k-1' of them as optional services (multiple optional service MOS). The server is subject to breakdown while rendering service to the customers. The customers arrive in the system in Poisson fashion in batches with arrival rate. After getting FES, the customer may opt for first of MOS, with some probability; after completing it, he may opt for next MOS with some other probability and so on. The service time of FES is generally distributed, while service times of MOS are exponentially distributed. The noble feature of the present study is to employ MEP which helps us in finding precise performance measures. The derived approximate results based on MEP, are compared with exact results obtained in previous studies for different distributions as special cases. It is noticed that MEP provides an alternative approach for solving complex queueing systems, in particular when queue size distribution is to be computed.

Full-text

Download
6 Downloads
Available from
Feb 11, 2015