Browsing by Author "Afthab Begum, M I"
Now showing 1 - 18 of 18
Results Per Page
Sort Options
Item ANALYSIS OF AN M/G/1 QUEUE WITH EXPONENTIALLY DISTRIBUTED MULTIPLE AND SINGLE WORKING VACATIONS(2011) Afthab Begum, M IConsider an AY/C/l queue with exponentially distributed multiple and single working vacations where the ser\er cooks at a slower rate rather than completely stops service durinu \acation periods. Using supplementary vtiriable technique, we deme the sie,ul\-state distributions for the number of customers m the system both at the tirbitrar)' epoch and departure epoch. Further the expected system si/e and various probabilities are calculated and the results obtaineil are illustrated numerically.Item Bulk Service Queue with Accessible and Non-Accessible Batches(1994-04) Vaidehi, S; Afthab Begum, M IItem Bulk Services with Erlang Input(1994-05) Anuradha, M; Afthab Begum, M IItem A Comparison of Retrial MX/G/1 Queueing System Under Multiple Adapted Vacation Policy with Classical Vacation Policies(2018-04) Manju, S; Afthab Begum, M IItem Erlangian Bulk Service Queueing Model Under Servers Vacation(1997-05) Banu Suja, B; Afthab Begum, M IItem General Bulk Service Queueing System with Multiple Working Vacation(2013) Afthab Begum, M IThis paper analyses a single server with bulk service queue with general arrival pattern and multiple working vacation period. The model is analyzed by using Embedded Markov Chain technique. The steady state probability distribution at pre airival epoch and arbitrary epoch are derived and measures like mean queue length are calculated. Finally, through some numerical e.\amples, the parametric effect on the performance measures are discussed and presented graphically.Item Markovian General Bulk Service Queueing System with Additional Server and Vacation(1998-04) Jeevarathinam, K; Afthab Begum, M IItem Markovian Queues with General Bulk Service and Balking(1995-05) Devasena, K; Afthab Begum, M IItem Multi-Channel Markovian Queues(1993-05) Anubama, S; Afthab Begum, M IItem MVG/1 Queue with Disasters and Working Breakdowns(2016) Afthab Begum, M IIn this paper, M’^/G/I queue with disasters and working breakdowns services is analyzed. The system consists of a main server and a substitute server. It is assumed that disasters occur only when, the main server is in operation. The occurrence of disasters forces all customers to leave the system and causes the main server to fail. At a failure instant, the main server is sent to the repair facility and the repair period begins immediately. During the repair period, the system is equipped with the substitute server which provides the working breakdown services to arriving customers. The concept of working breakdown services is included and the steady state system size distribution is derived. Various performance measures are derived and the effects of system parameters on queue length are studied.Item Mx [M1] QUEUE WITH WORKING VACATION(2010) Julia Rose Mary, K; Afthab Begum, M IIn this paper a batch arrival Nf/M/I queue with exponentially distributed multiple and single working v jca tio n s is analyzed.The queuing system is modeled as a two-dimensional Markov-chain to obtain the Chapman- Ko.'mogrov equations. The probability generating function (p!jf) of the steady state system size probabilities is derived for the model and the expected system size probabilities are presented in closed form. Further various performance measures including the expected queue length and their graohical representations are presented. Special cases are also discussed.Item Mx/G/1 Vacation Queueing Models with Bilevel Thresholds, Multifarious Services, Immediate Feedbacks and Service Interruptions(2016-08) Fijy Jose, P; Afthab Begum, M IItem N) POLICY FOR REPAIRABLE BULK 4 ARRIVAL QUEUEINGMODELWITH SE TUP,SECOND MUL TI OPTIONAL SERVICE FACILITY UNDER RESTRICTED NUMBER OF (L) SERVER VACATIONS(2016) Afthab Begum, M IThis paper analyses a repairable batch arrival queueing model with a second multi optional service(SOS) channels under (m,N) policy in which the server takes restricted number of multiple vacations during his idle period.The server leaves the system for vacation as soon as the system empties and after returning from each vacation if the server finds ‘m’ or more customers in the system then he immediately starts the setup work. Othersvise he repeats his vacation until he finally finds at least ‘m’ customers or, returns to the system after taking ‘L’ vacations.ie At the end of L"' vacation if the serv'er finds less than ‘m’ customers, he joins the system and stays idle until the queue length reaches at Ipast ‘m’ ^o start the setup work. At the end of the setup period, if the queue length is greater than or equal to N, then the setwer begins to serve the customers one at a tinic.Othervvise, the server remains dormant in the system, waiting for the queue length to reach atleast N, to start the service. The server may undergo unpredictable breakdowns during the service apd sent for repair iinmcdiately.As soon as the repair is completed, the server returns to the customer whose service was interrupted. The system size distribution at random epochs and mean system length are calculated and the corresponding^results for the classical single and multiple vacation models are obtained as special cases.Item An Optimum Control of a Batch Arrival Queue with Second Optional Service and Setup tiyie under Bernoulli Vaction Schedule(2012) Afthab Begum, M IAll M'/G/l iiueiteiiig system with s e e o iid op tion al serv ice (SOS)is stud ied iitider Aipolicy an d lienwuHi Vacatioti. The system remains id le until the qu eu e size r e a ch e s or ex c e ed s N (> I). When the qu eu e size r e a ch e s at leitst\, the server may begin his setup op eration with p robability s o r tnay start the serv ice with p robability ( l-s). The serv er provides two p h a s e s o f h eterog etieou s services, o f which, first p h a s e o f serv ice is essen tia l attd secon d p h a s e o f serv ice is opiiotial. I v soon as the first essen tial serv ice (FES) o f a unit is com p leted , the custouter tnay lea v e the systetn with p robability (l-r) o r tnay immediately opt fo r SOS with p robability r, Whetieverthe serv ice o f ea ch unit is completed, th e se rv er will h a v e th e option o f lahitig v acaliotifliernoulli). Thus a customer com p letes his service, by utidergoing F E S alone, the serv er may ta k e a vacatioti with prob ab ility p/orstays id le o r cotititiue th e next serv ice to the new cu stom er ifatiy ,with p robability (l-p ij. I f th e customer who fin ish e s F E S p ro c e ed s to SOS them th e se rv er may ta k e vacation at th e end o f SOS with p ro b a b ility p 2 o r Slavs idle o r continues with th e F E S fo r the new customer*with probahilitv (l-p :) a cco rd in g as the system is empty o r having customers in the system. The qu eu e size distribution at a rand om ep o ch is o b ta in ed f o r this m od el using SVT an d various p a rticu la r ca ses a r e deduced. Furth er various p e r fo rm a n c e m easu res an d the optimum mattag em ent policy a re also derived.Item Queueing Models in Non-Markovian Environment(1993-05) Geethalakshmi, M; Afthab Begum, M IItem Single Server Non Markovian Models(1993-05) Thangam, M; Afthab Begum, M IItem Some Bulk-Servics Queueing Models(1996-05) Poorani, T; Afthab Begum, M IItem Two - Server Markovian Queues : Heterogeneous Vs Homogeneous(1995-05) Sukanya, N; Afthab Begum, M I