Making the customers wait: The optimal number of servers in a queueing system
Tóm tắt
In a queueing systemM/M/c let the number of actual serversχ≤c be chosen depending on the statey (number of customers in the system). We consider an opportunity costw per server per unit of time and a waiting costh per customer per unit of time. Using Dynamic Programming the optimal policy forc=1 is found to be as follows. Use no server wheny1 under certain conditions.
Tài liệu tham khảo
Bellman R (1957) Dynamic programming. Princeton University Press, Princeton
Ferschl F (1964) Zufallsabhängige Wirtschaftsprozesse. Physica, Wien
Meyer KHF (1972) Ein Wartesystem mit heterogenen Kanälen unter (s, S)-Regel, Proceedings in Operations Research. Physica, Würzburg, pp 295–317
Meyer KHF (1974) Die optimale Abfertigungskapazität des Wartesystems GI/G/c, Proceedings in Operations Research. Physica, Würzburg, pp 349–371