USING STATE-DEPENDENT PROCESSING RATES TO EMULATE SPT QUEUE DISCIPLINE IN AN FCFS QUEUING NETWORK

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