论文信息 - A Control Policy for a Priority Queue with Removable Server

A Control Policy for a Priority Queue with Removable Server

This paper studies a control policy for an M/G/1 nonpreemptive-priority queuing system with removable server and two priority classes. This policy turns off the server when the system is empty and turns him on when a given linear combination of the numbers of class 1 and class 2 customers in the system exceeds a certain value. Expressions for the long-run average numbers of class 1 and class 2 customers in the system are derived.

Henk C. Tijms | H. Tijms

[1] M. Yadin,et al. Queueing Systems with a Removable Service Station , 1963 .

[2] William S. Jewell,et al. A Simple Proof of: L = λW , 1967, Oper. Res..

[3] Daniel P. Heyman,et al. Optimal Operating Policies for M/G/1 Queuing Systems , 1968, Oper. Res..

[4] Colin E. Bell,et al. Characterization and Computation of Optimal Policies for Operating an M/G/1 Queuing System with Removable Server , 1971, Oper. Res..

[5] S. Stidham. Regenerative processes in the theory of queues, with applications to the alternating-priority queue , 1972, Advances in Applied Probability.

[6] Shaler Stidham,et al. L = λW: A Discounted Analogue and a New Proof , 1972, Oper. Res..

[7] Kashi R. Balachandran,et al. Control Policies for a Single Server System , 1973 .