BOUNDS FOR DIFFERENT ARRANGEMENTS OF TANDEM QUEUES WITH NONOVERLAPPING SERVICE TIMES

• 成果类型: Article
• 署名作者: WAN, Y; WOLFF, RW
• 署名单位: University of California System; University of California Berkeley
• 刊物名称: MANAGEMENT SCIENCE
• ISSN/ISSBN: 0025-1909
• DOI: 10.1287/mnsc.39.9.1173
• 发表日期: 1993
• 页码: 1173-1178
• 关键词: DETERMINISTIC BOUNDS ON FINITE INTERVALS; SAMPLE-PATH; TIME-AVERAGE; CUSTOMER-AVERAGE BOUNDS; blocking

摘要

We bound the difference in performance measures among different orders of tandem queues when service times are nonoverlapping. Two types of nonoverlapping service times, with respect to (w.r.t.) tasks and w.r.t. customers, are defined; it is not required that service times be independent. For nonoverlapping service times w.r.t. tasks, we bound the sample-path difference in number of customers in system by one, and bound the corresponding time-average difference by the traffic intensity of the longest station. For nonoverlapping service times w.r.t. customers, we bound the difference in mean sojourn time when the service times are bounded random variables. While we are motivated by probabilistic results, our methods and results are entirely deterministic.