Optimal ( d, c) vacation policy for a finite buffer M/M/c queue with unreliable servers and repairs

This paper considers a finite buffer M/M/c queueing system in which servers are unreliable and follow a ( d, c) vacation policy. With such a policy, at a service completion instant, if the number of customers is reduced to c − d ( c > d), the d idle servers together take a vacation (or leave for...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Applied mathematical modelling 2009-10, Vol.33 (10), p.3949-3962
Hauptverfasser:	Ke, Jau-Chuan, Lin, Chuen-Horng, Yang, Jyun-Yi, Zhang, Zhe George
Format:	Artikel
Sprache:	eng
Schlagworte:	Average profit Direct search algorithm Markovian queue Server vacations Unreliable servers
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!