Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 김종수 | - |
dc.date.accessioned | 2020-12-15T04:46:33Z | - |
dc.date.available | 2020-12-15T04:46:33Z | - |
dc.date.issued | 2003-08 | - |
dc.identifier.citation | Applied Mathematical Modelling, v. 27, issue 8, page. 665-675 | en_US |
dc.identifier.issn | 0307-904X | - |
dc.identifier.uri | https://www.sciencedirect.com/science/article/pii/S0307904X0300074X?via%3Dihub | - |
dc.identifier.uri | https://repository.hanyang.ac.kr/handle/20.500.11754/156173 | - |
dc.description.abstract | We can optimize the operating cost of an M/G/1 system using various control policies. Existing research results are largely concerned with optimizing the system under a single policy. In this study, we consider an M/G/1 system with two policies, N- and T-policy simultaneously. If either condition of N- or T-policy are satisfied, then the server starts the service. We call this Min(N,T)-policy. We find the probability distribution of the number of customers at a steady state and establish a cost function to reveal the characteristics of the cost function and find the optimal operating policy. | en_US |
dc.language.iso | en_US | en_US |
dc.publisher | ELSEVIER SCIENCE INC | en_US |
dc.subject | Control | en_US |
dc.subject | Distribution | en_US |
dc.subject | Optimization | en_US |
dc.subject | Queueing | en_US |
dc.title | An analysis of the M/G/1 system with N and T policy | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1016/S0307-904X(03)00074-X | - |
dc.relation.journal | APPLIED MATHEMATICAL MODELLING | - |
dc.contributor.googleauthor | Hur, Sun | - |
dc.contributor.googleauthor | Kim, Jongsoo | - |
dc.contributor.googleauthor | Kang, Changwook | - |
dc.relation.code | 2011200850 | - |
dc.sector.campus | E | - |
dc.sector.daehak | COLLEGE OF ENGINEERING SCIENCES[E] | - |
dc.sector.department | DEPARTMENT OF INDUSTRIAL AND MANAGEMENT ENGINEERING | - |
dc.identifier.pid | pure | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.