Abstract
Simple interchange arguments are applied for solving classical scheduling problems in queues. We first show that the μc- rule minimizes a fairly general cost function in a multiclass ·/M/1 queue. Then, we address the same problem when partial feedback and change of class are allowed. Finally, we consider two ·/M/1 queues in series and we show that the μc-rule is always optimal in the second node.
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
