Publications-Periodical Articles
Article View/Open
Publication Export
Google ScholarTM
NCCU Library
Citation Infomation
-
Loading...Loading...
Related Publications in TAIR
| Title | Threshold control policies for heterogeneous server systems |
| Creator | Luh, Hsing Paul 陸行 Viniotis Ioannis |
| Key Words | Queueing ; Linear Programming ; Dynamic Programming ; Markov Processes |
| Date | 2002-01 |
| Date Issued | 24-Dec-2008 13:29:46 (UTC+8) |
| Summary | 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, S 1,S 2,… , S N. 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 S i, if this server is the fastest server available and the number of customers in the queue is m i or more. The threshold m i 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. |
| Relation | Mathematical Methods of Operations Research,55(1),121-242 |
| Type | article |
| DOI | http://dx.doi.org/10.1007/s001860100168 |
| dc.creator (作者) | Luh, Hsing Paul | en_US |
| dc.creator (作者) | 陸行 | - |
| dc.creator (作者) | Viniotis Ioannis | en_US |
| dc.date (日期) | 2002-01 | en_US |
| dc.date.accessioned | 24-Dec-2008 13:29:46 (UTC+8) | - |
| dc.date.available | 24-Dec-2008 13:29:46 (UTC+8) | - |
| dc.date.issued (上傳時間) | 24-Dec-2008 13:29:46 (UTC+8) | - |
| dc.identifier.uri (URI) | https://nccur.lib.nccu.edu.tw/handle/140.119/18697 | - |
| 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, S 1,S 2,… , S N. 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 S i, if this server is the fastest server available and the number of customers in the queue is m i or more. The threshold m i 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 | application/ | en_US |
| dc.language | en | en_US |
| dc.language | en-US | en_US |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | Mathematical Methods of Operations Research,55(1),121-242 | en_US |
| dc.subject (關鍵詞) | Queueing ; Linear Programming ; Dynamic Programming ; Markov Processes | - |
| dc.title (題名) | Threshold control policies for heterogeneous server systems | en_US |
| dc.type (資料類型) | article | en |
| dc.identifier.doi (DOI) | 10.1007/s001860100168 | - |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1007/s001860100168 | - |