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
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.citation.endPage | 93 | - |
| dc.citation.number | 1 | - |
| dc.citation.startPage | 84 | - |
| dc.citation.title | JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS | - |
| dc.citation.volume | 141 | - |
| dc.contributor.author | Jung, Mooyoung | - |
| dc.contributor.author | LEE, ES | - |
| dc.date.accessioned | 2023-12-22T13:09:59Z | - |
| dc.date.available | 2023-12-22T13:09:59Z | - |
| dc.date.created | 2014-09-05 | - |
| dc.date.issued | 1989-07 | - |
| dc.description.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. | - |
| dc.identifier.bibliographicCitation | JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, v.141, no.1, pp.84 - 93 | - |
| dc.identifier.doi | 10.1016/0022-247X(89)90207-2 | - |
| dc.identifier.issn | 0022-247X | - |
| dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/5937 | - |
| dc.identifier.wosid | A1989AG98900006 | - |
| dc.language | 영어 | - |
| dc.publisher | ACADEMIC PRESS INC ELSEVIER SCIENCE | - |
| dc.title | NUMERICAL OPTIMIZATION OF A QUEUING SYSTEM BY DYNAMIC-PROGRAMMING | - |
| dc.type | Article | - |
| dc.description.journalRegisteredClass | scopus | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.