Article View/Open
Publication Export
Related Publications in TAIR
- > Simple Record
- > Full Record
| Field |
Value |
| Title: | Threshold control policies for heterogeneous server systems |
| Authors: | Luh, Hsing Paul;Viniotis, Ioannis
陸行 |
| Contributors: | 應數系 |
| Keywords: | Queueing;Linear Programming;Dynamic Programming;Markov Processes |
| Date: | 2002-03 |
| Issue Date: | 2015-01-14 15:55:19 (UTC+8) |
| 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. |
| Relation: | Mathematical Methods of Operations Research, 55(1), 121-142 |
| Data Type: | article |
| DOI: | http://dx.doi.org/10.1007/s001860100168 |
| DCField |
Value |
Language |
| dc.contributor (Contributor) | 應數系 | - |
| dc.creator (Authors) | Luh, Hsing Paul;Viniotis, Ioannis | - |
| dc.creator (Authors) | 陸行 | - |
| dc.date (Date) | 2002-03 | - |
| dc.date.accessioned | 2015-01-14 15:55:19 (UTC+8) | - |
| dc.date.available | 2015-01-14 15:55:19 (UTC+8) | - |
| dc.date.issued (Issue Date) | 2015-01-14 15:55:19 (UTC+8) | - |
| dc.identifier.uri (URI) | http://140.119.115.13/handle/140.119/72877 | - |
| dc.description.abstract (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 (Relation) | Mathematical Methods of Operations Research, 55(1), 121-142 | - |
| dc.subject (Keywords) | Queueing;Linear Programming;Dynamic Programming;Markov Processes | en_US |
| dc.title (Title) | Threshold control policies for heterogeneous server systems | - |
| dc.type (Data Type) | article | en |
| dc.identifier.doi (DOI) | 10.1007/s001860100168 | - |
| dc.doi.uri | http://dx.doi.org/10.1007/s001860100168 | - |
(943)