DUAL‐RESOURCE PARALLEL QUEUES WITH SERVER TRANSFER AND INFORMATION ACCESS DELAYS*
通过计算机仿真研究双资源约束排队系统中服务器分配策略，发现延迟分配可降低作业流程时间的均值与方差，并测试了基于最短处理时间优先的分配规则。
Dual‐resource constrained queuing systems contain fewer servers than service facilities. This study uses computer simulation to evaluate several server assignment procedures in a dual‐resource system. A field study serves as the basis for developing a model with two service facilities in parallel, a single server, and deterministic information access and transfer delays that can be applied to job shops, computer operating systems, and elevators. Several findings, useful in server assignment decision making, resulted from the study. If first‐come, first‐served sequencing is used, delaying server assignment at a facility until all jobs are completed reduces both the mean and the variance of job flow time. If shortest‐process‐time‐first sequencing is used, an assignment rule is tested that delays a server at a facility until a sufficiently short job is estimated to have arrived elsewhere. This rule performs best overall in terms of both the mean and variance of flow time. Methods to implement this decision rule easily are discussed.