查詢結果分析
來源資料
相關文獻
- 布阿松管制量輪詢系統之研究
- Polling Systems with First-Come-First-Served Service Discipline
- An M/G/1/1 Feedback Queue with Regular and Optional Services
- An M/G/1/1 Queue with Unreliable Server and No Waiting Capacity
- Six Control Mechanisms of Serial Production Systems
- 相互獨立「二次到達」等候系統之解析研究
- 相互干擾「二次到達」等候系統之解析研究
- On the Output Process of the Erlangian Queueing Systems
- 序的最佳化於G/G/1/K輪詢系統之應用
- Moments of the Interdeparture Times in a Tandem Network with Poisson Arrival
頁籤選單縮合
題 名 | 布阿松管制量輪詢系統之研究=The Analysis and Study of Poisson-Gated Polling Systems |
---|---|
作 者 | 張國華; 鍾聖晴; | 書刊名 | 工業工程學刊 |
卷 期 | 15:1 1998.01[民87.01] |
頁 次 | 頁27-33 |
分類號 | 319.9 |
關鍵詞 | 輪詢系統; 等候系統; 非純粹守恆定律; Polling system; Queuing systems; Pseudo-conservation law; |
語 文 | 中文(Chinese) |
中文摘要 | 輪詢系統包含一個服務者以及多個服務站或等候站,物件由外進入服務站等候服 務, 而服務者依某一次序至多個服務站做服務。 輪詢系統主要的應用範圍是可將通訊網路 token ring、token bus、ARQ、 TDMA 和 slotted ring 等等以輪詢系統的模式評估其效能 。另一方面輪詢系統的模式亦可應用在自動化工程上,如彈性製造系統、機器手臂加工系統 、自動倉儲系統以及無人搬運車。本篇研究的是布阿松管制量輪詢系統,其中服務者到達各 站時以一個布阿松隨機變數決定他的服務量 (要服務的物件數 )。假設 Xi 為服務者到達服 務站 i 時,所觀察到的人數,我們以 Xi 為該布阿松隨機變數之參數 (平均值 )。 在這個 系統中我們推導出 E [Xi] 之上下界限,同樣地,我們也推導出非純粹守恆定率律中加權平 均等待時間總合之上下界限,同時並與二項式管制量等輪詢系統的結果加以比較。 |
英文摘要 | A polling system consists of a single server and several service stations. Customers coming into these stations from outside wait for service and the server visits each station according to some specified rules. The main application of the polling system is on the communication network. It helps us to model systems such as token ring, token bus, ARQ, TDMA,... etc. It is also suitable for describing manufacturing systems like FMS, robotics system, AS/RS and AGV system. One special polling system is called the probability-limited system in which the server serves a random number of customers in each station. In this paper, we study Poisson-gated polling systems. Let Xi be the number of customers that the server observes when he arrives at station i. In our system, the number of services for each visit to station i is Poisson distributed with mean Xi. We obtained the upper bound and lower bound of E[Xi] as well as the weighted sum of average waiting times which is represented by the Pseudo-conservation law for this system. The comparisons between the traditional polling systems (e.g. Exhaustive, Gated,... etc.) and binomial gated systems are also investigated. |
本系統中英文摘要資訊取自各篇刊載內容。