Optimal server assignment in a two-stage tandem queueing system
dc.creator | Papachristos I., Pandelis D.G. | en |
dc.date.accessioned | 2023-01-31T09:41:59Z | |
dc.date.available | 2023-01-31T09:41:59Z | |
dc.date.issued | 2020 | |
dc.identifier | 10.1016/j.orl.2019.12.001 | |
dc.identifier.issn | 01676377 | |
dc.identifier.uri | http://hdl.handle.net/11615/77529 | |
dc.description.abstract | We study Markovian queueing systems consisting of two stations in tandem. There is a dedicated server in each station and an additional server that can be assigned to any station. Assuming that linear holding costs are incurred by jobs in the system and two servers can collaborate to work on the same job, we determine structural properties of optimal server assignment policies under the discounted and the average cost criteria. © 2019 Elsevier B.V. | en |
dc.language.iso | en | en |
dc.source | Operations Research Letters | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85076629247&doi=10.1016%2fj.orl.2019.12.001&partnerID=40&md5=c29ad45bd2a447105ee5ecda36cee7b8 | |
dc.subject | Markov processes | en |
dc.subject | Queueing theory | en |
dc.subject | Structural optimization | en |
dc.subject | Average-cost criteria | en |
dc.subject | Dedicated servers | en |
dc.subject | Holding costs | en |
dc.subject | Markov Decision Processes | en |
dc.subject | Markovian | en |
dc.subject | Queueing system | en |
dc.subject | Server assignment | en |
dc.subject | Tandem queue | en |
dc.subject | Queueing networks | en |
dc.subject | Elsevier B.V. | en |
dc.title | Optimal server assignment in a two-stage tandem queueing system | en |
dc.type | journalArticle | en |
Αρχεία σε αυτό το τεκμήριο
Αρχεία | Μέγεθος | Τύπος | Προβολή |
---|---|---|---|
Δεν υπάρχουν αρχεία που να σχετίζονται με αυτό το τεκμήριο. |