Publications-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 Threshold control policies for heterogeneous server systems
作者 Luh, Hsing Paul;Viniotis, Ioannis
陸行
貢獻者 應數系
關鍵詞 Queueing;Linear Programming;Dynamic Programming;Markov Processes
日期 2002-03
上傳時間 14-Jan-2015 15:55:19 (UTC+8)
摘要 We study the problem of optimally controlling a multiserver queueing system. Customers arrive in a Poisson fashion and join a single queue, served by N servers, S1,S2,... , SN. The servers have different rates. The service times at each server are independent and exponentially distributed. The objective is to determine the policy which minimizes the average number of customers in the system. We show that any optimal, nonpreemptive policy is of threshold type, i.e., it assigns a customer to server Si, if this server is the fastest server available and the number of customers in the queue is mi or more. The threshold mi may depend on the condition of other (slower) servers at the decision instant. In order to establish the results, we reformulate the optimal control problem as a linear program and use a novel argument based on the structure of the constraint matrix.
關聯 Mathematical Methods of Operations Research, 55(1), 121-142
資料類型 article
DOI http://dx.doi.org/10.1007/s001860100168
dc.contributor 應數系-
dc.creator (作者) Luh, Hsing Paul;Viniotis, Ioannis-
dc.creator (作者) 陸行-
dc.date (日期) 2002-03-
dc.date.accessioned 14-Jan-2015 15:55:19 (UTC+8)-
dc.date.available 14-Jan-2015 15:55:19 (UTC+8)-
dc.date.issued (上傳時間) 14-Jan-2015 15:55:19 (UTC+8)-
dc.identifier.uri (URI) http://140.119.115.13/handle/140.119/72877-
dc.description.abstract (摘要) We study the problem of optimally controlling a multiserver queueing system. Customers arrive in a Poisson fashion and join a single queue, served by N servers, S1,S2,... , SN. The servers have different rates. The service times at each server are independent and exponentially distributed. The objective is to determine the policy which minimizes the average number of customers in the system. We show that any optimal, nonpreemptive policy is of threshold type, i.e., it assigns a customer to server Si, if this server is the fastest server available and the number of customers in the queue is mi or more. The threshold mi may depend on the condition of other (slower) servers at the decision instant. In order to establish the results, we reformulate the optimal control problem as a linear program and use a novel argument based on the structure of the constraint matrix.-
dc.format.extent 201754 bytes-
dc.format.mimetype application/pdf-
dc.relation (關聯) Mathematical Methods of Operations Research, 55(1), 121-142-
dc.subject (關鍵詞) Queueing;Linear Programming;Dynamic Programming;Markov Processesen_US
dc.title (題名) Threshold control policies for heterogeneous server systems-
dc.type (資料類型) articleen
dc.identifier.doi (DOI) 10.1007/s001860100168-
dc.doi.uri (DOI) http://dx.doi.org/10.1007/s001860100168-