ANALYSIS OF A DISCRETE-TIME IMPATIENT CUSTOMER QUEUE WITH BERNOULLI-SCHEDULE VACATION INTERRUPTION
محورهای موضوعی : فصلنامه ریاضیP. Vijaya Laxmi 1 , K. Jyothsna 2
1 - Department of Applied Mathematics, Andhra University, Visakhapatnam 530003, India.
2 - Department of Applied Mathematics, Andhra University, Visakhapatnam 530003, India.
کلید واژه: particle swarm optimization, discrete-time, balking, Reneging, Bernoulli-schedule vacation interruption,
چکیده مقاله :
This paper investigates a discrete-time impatient customer queue with Bernoulli-schedule vacation interruption. The vacation times and the service times during regular busy period and during working vacation period are assumed to follow geometric distribution. We obtain the steady-state probabilities at arbitrary and outside observer's observation epochs using recursive technique. Cost analysis is carried out using particle swarm optimization. Computational experiences with a variety of numerical results are discussed.