dc.contributor.advisor | Jérémie Gallien. | en_US |
dc.contributor.author | Weber, Theophane | en_US |
dc.contributor.other | Massachusetts Institute of Technology. Operations Research Center. | en_US |
dc.date.accessioned | 2006-03-29T18:35:34Z | |
dc.date.available | 2006-03-29T18:35:34Z | |
dc.date.copyright | 2005 | en_US |
dc.date.issued | 2005 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/32339 | |
dc.description | Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2005. | en_US |
dc.description | Includes bibliographical references (p. 75-79). | en_US |
dc.description.abstract | 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. | en_US |
dc.description.statementofresponsibility | by Theophane Weber. | en_US |
dc.format.extent | 79 p. | en_US |
dc.format.extent | 2869773 bytes | |
dc.format.extent | 2873044 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | application/pdf | |
dc.language.iso | eng | en_US |
dc.publisher | Massachusetts Institute of Technology | en_US |
dc.rights | 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. | en_US |
dc.rights.uri | http://dspace.mit.edu/handle/1721.1/7582 | |
dc.subject | Operations Research Center. | en_US |
dc.title | Conditional dynamics of non-Markovian, infinite-server queues | en_US |
dc.type | Thesis | en_US |
dc.description.degree | S.M. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Operations Research Center | en_US |
dc.contributor.department | Sloan School of Management | |
dc.identifier.oclc | 61463259 | en_US |