完整後設資料紀錄
DC 欄位語言
dc.contributor.authorKuo, Ching-Changen_US
dc.contributor.authorWang, Kuo-Hsiungen_US
dc.contributor.authorPearn, W. L.en_US
dc.date.accessioned2014-12-08T15:27:21Z-
dc.date.available2014-12-08T15:27:21Z-
dc.date.issued2011-09-01en_US
dc.identifier.issn1684-3703en_US
dc.identifier.urihttp://hdl.handle.net/11536/19603-
dc.description.abstractThis paper studies the interrelationship between the N-policy M/G/1/K queue and the F-policy G/M/1/K queue. The N-policy queuing problem investigates the most common issue of controlling service. The F-policy queuing problem deals with the most common issue of controlling arrivals. We provide a recursive method, using the supplementary variable technique and treating the supplementary variable as the remaining service time, to develop the solution algorithm for the N-policy M/G/1/K queue with startup time. We have demonstrated that the N-policy M/G/1/K queue with startup time has been effectively used to derive the solution algorithm to the F-policy G/M/1/K queue with startup time. The interrelationship between the N-policy and the F-policy queueing problems are illustrated analytically for 3-stage Erlang (service or interarrival) time distribution.en_US
dc.language.isoen_USen_US
dc.subjectF-policyen_US
dc.subjectG/M/1/K queueen_US
dc.subjectM/G/1/K queueen_US
dc.subjectN-policyen_US
dc.subjectrecursive methoden_US
dc.subjectstartup timeen_US
dc.subjectsupplementary variableen_US
dc.titleThe Interrelationship Between N-policy M/G/1/K and F-policy G/M/1/K Queues with Startup Timeen_US
dc.typeArticleen_US
dc.identifier.journalQUALITY TECHNOLOGY AND QUANTITATIVE MANAGEMENTen_US
dc.citation.volume8en_US
dc.citation.issue3en_US
dc.citation.spage237en_US
dc.citation.epage251en_US
dc.contributor.department工業工程與管理學系zh_TW
dc.contributor.departmentDepartment of Industrial Engineering and Managementen_US
dc.identifier.wosnumberWOS:000294746500002-
dc.citation.woscount0-
顯示於類別:期刊論文