Table of Contents
ISRN Probability and Statistics
Volume 2013, Article ID 508045, 6 pages
Research Article

Note on a Binomial Schedule for an MX/G/1 Queueing System with an Unreliable Server

1Laboratoire LaRoMa, Département de Recherche Opérationnelle, Faculté des Mathématiques, Université des Sciences et de la Technologie Houari Boumediene, Algiers 16111, Algeria
2Department of Information Systems and Decision Sciences, Silberman College of Business, Fairleigh Dickinson University, Vancouver, BC, Canada V6B 2P6

Received 26 May 2013; Accepted 7 July 2013

Academic Editors: M. Galea and J. López-Fidalgo

Copyright © 2013 Abdelhak Mezghiche and Lotfi Tadj. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


We consider in this paper a batch arrival queueing system with an unreliable server. If the queue is empty at a service completion, then the server becomes inactive and begins an idle period. However, if the queue is not empty, then the server will take at most vacation before serving the next customer. A linear cost structure is developed for the system and the optimal value of is obtained.