| dc.creator |
Hall, Susan A. |
|
| dc.creator |
Larson, Richard C., 1943- |
|
| dc.date |
2004-05-28T19:28:49Z |
|
| dc.date |
2004-05-28T19:28:49Z |
|
| dc.date |
1991-05 |
|
| dc.date.accessioned |
2013-10-09T02:38:29Z |
|
| dc.date.available |
2013-10-09T02:38:29Z |
|
| dc.date.issued |
2013-10-09 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/5222 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.description |
The Queue Inference Engine (QIE) uses queue departure time data over a single congestion period to infer queue statistics. With partial queue-length information, the queue statistics become more accurate and the computational burden is reduced. We first consider the case in which we are given that the queue length never exceeded a given length L. We then consider the more general case in which we are given the times of all L-to-(L + 1) and (L + 1)-to-L queue-length transitions. We present algorithms, parallel to the QIE algorithms,for deriving the queue statistics under the new conditioning information. We also present computational results, comparing both accuracy and computation time, under the QIE and the new algorithms, for several sample runs. |
|
| dc.format |
2410811 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
en_US |
|
| dc.publisher |
Massachusetts Institute of Technology, Operations Research Center |
|
| dc.relation |
Operations Research Center Working Paper;OR 254-91 |
|
| dc.title |
Using Partial Queue-Length Information to Improve the Queue Inference Engine's Performance |
|
| dc.type |
Working Paper |
|