A practical queue-ordering algorithm to improve throughput of a server with sequence dependent make-ready delay

摘要

A queue-server such as a magnetic drum or disk storage device requires a make-ready time after service to one call before actual service to the next call can begin which depends on the call descriptions and the characteristics of the device.

The algorithm presented here approximates the ordering of the queue for such a server so as to achieve the minimum total service time for the whole queue by a method analagous to the insertion method of approximate solution of the travelling salesperson problem.