中山管理評論  1995/9
第3卷第3期 p.116-122
School of Management Dalian University of Technology, Dalian Municipal commission of Foreign Economics Reeations and Trade
本文研究了一類排隊空間有限且服務台可能失效和可修的Fork-Join排隊網路(RFJQN),給出了排隊論和可修理論所感興趣的一些指標(如穩態概率、穩態隊長、服務台的可用度和服務台的失效概率)的計算方法。並且基於性能分析進行參數優化,最後給出仿真實例。
(75_03037_Abs.pdf(檔案不存在))Fork-Join排隊網路、可修系統、穩態分布、失效概率、優化
A class of repairable fork-join queueing networks (RFJQN) with finite queueing spaces and possible faliure and repairable servers is considered. The calculation methods for some interested performance measures (such as steady-state probatilities, steady-state queue length, failure probabilites of server and utilizable rates of server) in queueing theory and repairable theory are obtained. Additionally, Parameters are optimized based on performance analysis. Finally, examples are given by simulation.
(75_03037_Abs.pdf(檔案不存在))Fork-Join Queueing Networks; Repairable Systems; Steady State Distribution; Failure Probatilities; Optimization