Utilizing customers' service-time information, we study an easy-to-implement scheduling policy with two priority classes. By carefully designing the classes, the two-class priority rule achieves near-optimal performance. In particular, for a single-server queue, as the traffic intensity approaches 1, the policy achieves a scaling for the queue length processes that is similar to the shortest remaining processing time first policy. Our analysis quantifies how the tail of the service time distribution affects the benefits one can gain from service-time-based scheduling policies. When the service times are misspecified, we further quantify how imperfect observation of the service time affects the performance of the two-class priority rule through both theoretical and numerical analysis. Our results demonstrate the robustness of the two-class priority rule. Specifically, even with imperfect service-time information, the two-class priority rules can still achieve substantial performance improvement over the first come first served.

翻译：我们利用客户的服务时间信息,用两个优先类别来研究一种容易执行的时间安排政策。通过仔细设计分类,二等优先规则取得了接近最佳的绩效。特别是,对于单服务器队列,随着交通强度接近1,该政策实现了排队长度流程的缩放,类似于剩余的最短处理时间的第一次政策。我们的分析将服务时间分配的尾端如何影响基于服务时间的时间安排政策所带来的好处。当服务时间被错误地规定时,我们通过理论和数字分析进一步量化对服务时间的观察如何不完善地影响二等优先规则的绩效。我们的结果显示了两等优先规则的稳健性。具体地说,即使服务时间信息不完善,两等优先规则仍然可以在第一个服务时间上取得显著的业绩改进。