A queue with service interruptions in an alternating random environment
Operations Research
Workloads and waiting times in single-server systems with multiple customer classes
Proceedings of the workshop held at the Mathematical Sciences Institute Cornell University on Mathematical theory of queueing systems
Optimal NT policies for M/G/1 system with a startup and unreliable server
Computers and Industrial Engineering
Discrete-time GeoX/G/1 queue with unreliable server and multiple adaptive delayed vacations
Journal of Computational and Applied Mathematics
Optimization of the T policy M/G/1 queue with server breakdowns and general startup times
Journal of Computational and Applied Mathematics
The N-policy for an unreliable server with delaying repair and two phases of service
Journal of Computational and Applied Mathematics
Journal of Computational and Applied Mathematics
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.98 |
This paper studies the vacation policy of an M/G/1 queueing system with an unreliable server and startup. After all the customers are served in the queue exhaustively, the server deactivates and takes at most J vacations of constant time length T repeatedly until at least one customer is found waiting in the queue upon returning from a vacation. If at least one customer presents in the system when the server returns from a vacation, then the server reactivates and requires a startup time before providing the service. On the other hand, if no customers arrive by the end of the J^t^h vacation, the server remains dormant in the system until at least one customer arrives. We will call the policy modified T vacation policy. Furthermore, it is assumed that the server breaks down according to a Poisson process and his repair time has a general distribution. We analyze the system characteristics for this model.