Abstract
We consider an M/ G/1 queueing system under P λ M -service policy. As soon as the workload exceeds threshold λ > 0, the service rate is increased from 1 to M ⩾ 1 and is kept until the system becomes empty. After assigning several costs, we show that there exists a unique M minimizing the long-run average cost per unit time.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
