Optimization of Priority Class Queues, with a Computer Center Case Study

摘要

This paper discusses a case-study concerning key-punching in a computer center. This system is modeled as a queue with two servers (operators) and three priority classes (small, medium, and large jobs). Simulation is used to estimate the 90th quantiles of the waiting times per job class, for different borderlines c1and c2between the three job classes. Tradeoffs among the waiting times of each job class are quantified, and provide an overall citerion function. Several regression models are investigated, expressing the quantiles as functions in c1and c2. Optimal c1and c2are determined by a numerical search. The resulting limits have been implemented. The methodology is more generally applicable.