Using state-dependent processing rates to emulate SPT queue discipline in an FCFS queueing network. (shortest processing-time; first-come, first-served): An article from: IIE Transactions

This digital document is an article from IIE Transactions, published by Institute of Industrial Engineers, Inc. (IIE) on August 1, 1995. The length of the article is 5066 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available in your Amazon.com Digital Locker immediately after purchase. You can view it with any web browser.

From the author: Using the 'shortest processing time' queue discipline results in long queues being quickly reduced as the short jobs are quickly pushed through the system. We approximate this effect under the 'first-come, first-served' queue discipline by having the service rate increase with the queue length. That is, instead of picking the shortest job, the server instead picks the first job, but then processes it at a higher rate. This new load-dependent queue is compared with the original queue both individually and within open queueing networks.

Citation Details
Title: Using state-dependent processing rates to emulate SPT queue discipline in an FCFS queueing network. (shortest processing-time; first-come, first-served)
Author: Lawrence W. Robinson
Publication:IIE Transactions (Refereed)
Date: August 1, 1995
Publisher: Institute of Industrial Engineers, Inc. (IIE)
Volume: v27 Issue: n4 Page: p530(12)

Distributed by Thomson Gale