题名 |
Vacation Policies for Machine Interference Problem with an Un-Reliable Server and State-Dependent Service Rate |
并列篇名 |
具不可信任及不齊一服務者之機器修理問題的假期策略 |
DOI |
10.29977/JCIIE.200603.0002 |
作者 |
柯昭川(Jau-Chuan Ke) |
关键词 |
不齊一 ; 機器修理問題 ; 多重假期 ; 單一假期 ; 不可信任服務者 ; machine interference problem ; multiple vacations ; single vacation |
期刊名称 |
工業工程學刊 |
卷期/出版年月 |
23卷2期(2006 / 03 / 01) |
页次 |
100 - 114 |
内容语文 |
英文 |
中文摘要 |
本篇論文研究含有單一不齊一且不可信任服務者M/M/1機器修理問題的兩種假期策略:一組在線上操作之M台機器,由一個不齊一且不可信任服務者負責維修,當系統中沒有故障機器等待要維修時,服務者立即執行一個指數隨機長度的假期,且可能操作兩種假期策略。(1)多重假期:服務者從假期回來,若發現系統中沒有故障機器等待要維修,則繼續執行一序列隨機長度之假期,直到從假期回來發現至少有一故障機器等待要維修,即展開維修工作。(2)單一假期:服務者從第一個假期回來,若系統有故障機器,立即展開維修工作;若沒有故障機器,服務者則閒置在系統中直到故障機器到達。我們推導這兩個假期機器修理系統的穩態結果,建立其成本模式,作數值實驗,決定線上操作之最佳機器數,在最佳操作條件下實施敏感度分析。 |
英文摘要 |
This paper studies the machine interference problem consisting of M operating machines and an un-reliable server who leaves for a vacation of random length when there are no failed machines queuing up for repair in the repair facility. At the end of the vacation the server returns and operates two different vacation policies. In Policy 1, the server doesn't take a vacation again and remain idle until the first arriving failed machine arrives, which starts a busy period in the repair facility. In Policy 2, the server takes vacations repeatedly until they find the repair facility has at least one waiting failed machine in the queue. For both policies, a profit model is developed in order to determine the optimal value of the number of machines. Numerical results are provided in which several system characteristics are evaluated under optimal operating conditions. |
主题分类 |
工程學 >
工程學總論 |
参考文献 |
|