Numerical optimization of a queueing system by dynamic programming (Q1123582): Difference between revisions
From MaRDI portal
Revision as of 10:09, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Numerical optimization of a queueing system by dynamic programming |
scientific article |
Statements
Numerical optimization of a queueing system by dynamic programming (English)
0 references
1989
0 references
A numerical method for determining the optimal number of servers of a time-dependent multiserver queueing system is presented. First, a queueing system with time-dependent arrival rate is solved numerically to obtain the state probabilities and the expected number of customers in queue. The corresponding finite set of linear differential-difference equations is solved by the fourth-order Runge-Kutta method. Then, using the just obtained probabilities and queue sizes, dynamic programming is implemented to determine the optimal number of servers during each 8-h shift of a 24-h day. A numerical example, considering the arrival and service of aircrafts in an airport, is solved.
0 references
optimal number of servers
0 references
multiserver queueing system
0 references
time-dependent arrival rate
0 references
linear differential-difference equations
0 references
fourth-order Runge-Kutta method
0 references
dynamic programming
0 references
numerical example
0 references
service of aircrafts in an airport
0 references
