Mostrar el registro sencillo del ítem
On the optimal use of a slow server in two-stage queueing systems
dc.creator | Papachristos I., Pandelis D.G. | en |
dc.date.accessioned | 2023-01-31T09:42:00Z | |
dc.date.available | 2023-01-31T09:42:00Z | |
dc.date.issued | 2017 | |
dc.identifier | 10.1063/1.4992375 | |
dc.identifier.isbn | 9780735415386 | |
dc.identifier.issn | 0094243X | |
dc.identifier.uri | http://hdl.handle.net/11615/77531 | |
dc.description.abstract | We consider two-stage tandem queueing systems with a dedicated server in each queue and a slower flexible server that can attend both queues. We assume Poisson arrivals and exponential service times, and linear holding costs for jobs present in the system. We study the optimal dynamic assignment of servers to jobs assuming that two servers cannot collaborate to work on the same job and preemptions are not allowed. We formulate the problem as a Markov decision process and derive properties of the optimal allocation for the dedicated (fast) servers. Specifically, we show that the one downstream should not idle, and the same is true for the one upstream when holding costs are larger there. The optimal allocation of the slow server is investigated through extensive numerical experiments that lead to conjectures on the structure of the optimal policy. © 2017 Author(s). | en |
dc.language.iso | en | en |
dc.source | AIP Conference Proceedings | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85026630941&doi=10.1063%2f1.4992375&partnerID=40&md5=7189eb5de3c3c3ef6eb7951be7c8bcba | |
dc.subject | American Institute of Physics Inc. | en |
dc.title | On the optimal use of a slow server in two-stage queueing systems | en |
dc.type | conferenceItem | en |
Ficheros en el ítem
Ficheros | Tamaño | Formato | Ver |
---|---|---|---|
No hay ficheros asociados a este ítem. |