File Download
There are no files associated with this item.
SFX Link
- Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
- Jung, Mooyoung
Views & Downloads
Detailed Information
Cited time in 
Cited time in 
Cited time in
Metadata Downloads
NUMERICAL OPTIMIZATION OF A QUEUING SYSTEM BY DYNAMIC-PROGRAMMING
- Author(s)
- Jung, Mooyoung, LEE, ES
- Issued Date
- 1989-07
- Citation
- JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, v.141, no.1, pp.84 - 93
- Abstract
- A numerical method for obtaining the optimal number of servers of a time-dependent M/Ms queueing system is presented. First, an M/M/s queueing system with time-dependent arrival rate is solved numerically to obtain the state probabilities and the expected queue sizes. Then, the optimal number of servers during each 8-h shift of a 24-h day is obtained by dynamic programming. A numerical example is solved to show the effectiveness of the approach.
- Publisher
- ACADEMIC PRESS INC ELSEVIER SCIENCE
- ISSN
- 0022-247X
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.