A double-server double-class queue with constant retrial policy in reducing delay in healthcare delivery.

Show simple item record

dc.contributor.author Akuamoah, S. A.
dc.contributor.author Lu, D.
dc.contributor.author Zhang, H.
dc.contributor.author Yaro, D.
dc.contributor.author Apeanti, W. O.
dc.contributor.author Harvim, H.
dc.contributor.author Ocloo, C. E.
dc.date.accessioned 2023-01-23T14:45:10Z
dc.date.available 2023-01-23T14:45:10Z
dc.date.issued 2018
dc.identifier.issn 1749-3897
dc.identifier.uri http://www.internonlinearscience.org/upload/papers/IJNS%20Vol%2026%20No%202%20Paper%205-A%20Double-Server.pdf
dc.identifier.uri http://atuspace.atu.edu.gh:8080/handle/123456789/2653
dc.description.abstract We consider in this paper a double-server double-class retrial queues. Servers, when free, help serve patients awaiting in the buffers of other servers. Patients arrive at both queues according to Poisson processes. Each station is fed by a renewal input with general independent identically distributed inter-arrival times and general identically independent distributed service times possibly different in the two stations. All service times are exponential, with rates depending on the queues. The cost to be minimized involve cost per unit time that a patient spends in the system. We find a sufficient conditions including all possible parameter choices such as arrival rates, retrial rates and service rates. We further present conditions for scheduling new arrivals, under which server assignment to either queue-1 or queue-2 is cost optimal. en_US
dc.language.iso en_US en_US
dc.publisher International Journal of Nonlinear Science en_US
dc.relation.ispartofseries vol.;26
dc.subject Markov process en_US
dc.subject Retrial queues en_US
dc.subject Control policy en_US
dc.subject Dynamic programming en_US
dc.subject Health care en_US
dc.subject Double server en_US
dc.title A double-server double-class queue with constant retrial policy in reducing delay in healthcare delivery. en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account