241 0

Full metadata record

DC FieldValueLanguage
dc.contributor.author김종수-
dc.date.accessioned2020-12-15T04:46:33Z-
dc.date.available2020-12-15T04:46:33Z-
dc.date.issued2003-08-
dc.identifier.citationApplied Mathematical Modelling, v. 27, issue 8, page. 665-675en_US
dc.identifier.issn0307-904X-
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S0307904X0300074X?via%3Dihub-
dc.identifier.urihttps://repository.hanyang.ac.kr/handle/20.500.11754/156173-
dc.description.abstractWe 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.isoen_USen_US
dc.publisherELSEVIER SCIENCE INCen_US
dc.subjectControlen_US
dc.subjectDistributionen_US
dc.subjectOptimizationen_US
dc.subjectQueueingen_US
dc.titleAn analysis of the M/G/1 system with N and T policyen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/S0307-904X(03)00074-X-
dc.relation.journalAPPLIED MATHEMATICAL MODELLING-
dc.contributor.googleauthorHur, Sun-
dc.contributor.googleauthorKim, Jongsoo-
dc.contributor.googleauthorKang, Changwook-
dc.relation.code2011200850-
dc.sector.campusE-
dc.sector.daehakCOLLEGE OF ENGINEERING SCIENCES[E]-
dc.sector.departmentDEPARTMENT OF INDUSTRIAL AND MANAGEMENT ENGINEERING-
dc.identifier.pidpure-
Appears in Collections:
COLLEGE OF ENGINEERING SCIENCES[E](공학대학) > INDUSTRIAL AND MANAGEMENT ENGINEERING(산업경영공학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE