Full metadata record
DC FieldValueLanguage
dc.contributor.authorChang, Y. C.en_US
dc.contributor.authorPearn, W. L.en_US
dc.date.accessioned2014-12-08T15:38:07Z-
dc.date.available2014-12-08T15:38:07Z-
dc.date.issued2011en_US
dc.identifier.issn0020-7721en_US
dc.identifier.urihttp://hdl.handle.net/11536/26146-
dc.identifier.urihttp://dx.doi.org/10.1080/00207721.2011.570480en_US
dc.description.abstractIn this article, we consider an infinite capacity N-policy M/G/1 queueing system with a single removable server. Poisson arrivals and general distribution service times are assumed. The server is controllable that may be turned on at arrival epochs or off at service completion epochs. We apply a differential technique to study system sensitivity, which examines the effect of different system input parameters on the system. A cost model for infinite capacity queueing system under steady-state condition is developed, to determine the optimal management policy at minimum cost. Analytical results for sensitivity analysis are derived. We also provide extensive numerical computations to illustrate the analytical sensitivity properties obtained. Finally, an application example is presented to demonstrate how the model could be used in real applications to obtain the optimal management policy.en_US
dc.language.isoen_USen_US
dc.subjectanalytical resultsen_US
dc.subjectmanagement policyen_US
dc.subjectM/G/1 queueen_US
dc.subjectsensitivity analysisen_US
dc.titleOptimal management for infinite capacity N-policy M/G/1 queue with a removable service stationen_US
dc.typeArticleen_US
dc.identifier.doi10.1080/00207721.2011.570480en_US
dc.identifier.journalINTERNATIONAL JOURNAL OF SYSTEMS SCIENCEen_US
dc.citation.volume42en_US
dc.citation.issue7en_US
dc.citation.spage1075en_US
dc.citation.epage1083en_US
dc.contributor.department工業工程與管理學系zh_TW
dc.contributor.departmentDepartment of Industrial Engineering and Managementen_US
dc.identifier.wosnumberWOS:000291857800002-
dc.citation.woscount1-
Appears in Collections:Articles


Files in This Item:

  1. 000291857800002.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.