Conditional dynamics of non-Markovian, infinite-server queues
Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2005.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/32339 |
| _version_ | 1811081190597197824 |
|---|---|
| author | Weber, Theophane |
| author2 | Jérémie Gallien. |
| author_facet | Jérémie Gallien. Weber, Theophane |
| author_sort | Weber, Theophane |
| collection | MIT |
| description | Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2005. |
| first_indexed | 2024-09-23T11:42:52Z |
| format | Thesis |
| id | mit-1721.1/32339 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T11:42:52Z |
| publishDate | 2006 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/323392020-11-06T21:33:08Z Conditional dynamics of non-Markovian, infinite-server queues Weber, Theophane Jérémie Gallien. Massachusetts Institute of Technology. Operations Research Center. Massachusetts Institute of Technology. Operations Research Center Operations Research Center. Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2005. Includes bibliographical references (p. 75-79). We study the transient dynamics of a partially observed, infinite server queue fed with a Poisson arrival process whose controlled rate is changed at discrete points in time. More specifically, we define a state that incorporates partial information from the history of the process and write analytical formula for the dynamics of the system (state transition probabilities). Moreover, we develop an approximation method that makes the state finite-dimensional, and introduce techniques to further reduce the dimension of the state. This method could thus enable the formulation of tractable DPs in the future. by Theophane Weber. S.M. 2006-03-29T18:35:34Z 2006-03-29T18:35:34Z 2005 2005 Thesis http://hdl.handle.net/1721.1/32339 61463259 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 79 p. 2869773 bytes 2873044 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | Operations Research Center. Weber, Theophane Conditional dynamics of non-Markovian, infinite-server queues |
| title | Conditional dynamics of non-Markovian, infinite-server queues |
| title_full | Conditional dynamics of non-Markovian, infinite-server queues |
| title_fullStr | Conditional dynamics of non-Markovian, infinite-server queues |
| title_full_unstemmed | Conditional dynamics of non-Markovian, infinite-server queues |
| title_short | Conditional dynamics of non-Markovian, infinite-server queues |
| title_sort | conditional dynamics of non markovian infinite server queues |
| topic | Operations Research Center. |
| url | http://hdl.handle.net/1721.1/32339 |
| work_keys_str_mv | AT webertheophane conditionaldynamicsofnonmarkovianinfiniteserverqueues |