A regularly preemptive model and its approximations

A regularly preemptive model and its approximations

0.00 Avg rating0 Votes
Article ID: iaor20032090
Country: Netherlands
Volume: 113
Issue: 1
Start Page Number: 81
End Page Number: 100
Publication Date: Jul 2002
Journal: Annals of Operations Research
Authors: ,
Keywords: markov processes
Abstract:

A regularly preemptive model D,MAP/D1,D2/1 is studied. Priority customers have constant inter-arrival times and constant service times. On the other hand, ordinary customers' arrivals follow a Markovian Arrival process (MAP) with constant service times. Although this model can be formulated by using the piecewise Markov process, there remain some difficult problems on numerical calculations. In order to solve these problems, a novel approximation model MAP/MR/1 with Markov renewal services is proposed. These two queueing processes become different due to the existence of idle periods. Thus, a MAP/MR/1 queue with a general boundary condition is introduced. It is a model with the exceptional first service in each busy period. In particular, two special models are studied: one is a warm-up queue and the other is a cool-down queue. It can be proved that the waiting time of ordinary customers for the regular preemption model is stochastically smaller than the waiting time of the former model. On the other hand, it is stochastically larger than the waiting time of the latter model.

Reviews

Required fields are marked *. Your email address will not be published.