题名 |
On Determining the Optimal Maintenance Frequency for a Family of Machines |
并列篇名 |
群組機器最佳維修排程策略之研究 |
DOI |
10.29977/JCIIE.200505.0002 |
作者 |
姚銘忠(Ming-Jong Yao) |
关键词 |
維修管理 ; 群組設備 ; 維修排程 ; 最佳解結構 ; 搜尋演算法 ; A family of machines ; maintenance ; scheduling ; search algorithm |
期刊名称 |
工業工程學刊 |
卷期/出版年月 |
22卷3期(2005 / 05 / 01) |
页次 |
199 - 209 |
内容语文 |
英文 |
中文摘要 |
本研究主要在探討如何制訂最佳的計畫性維修排程策略,提高群組機械的營運效率,期望藉由決定其維修頻率與維修週期,在同時考量整體群組機械系統的維修成本與營運成本的前提下,使其單位時問的總成本能夠達到最小化。本研究的文獻探討顯示,最佳群組機械維修排程問題是週期維修排程問題中,唯一採用非線性作業成本的數學模式。為求解最佳的維修排程策略,本研究深入探討其數學模式的理論性質,並運用該模式之最佳解結構,提出有效率且可以保障品質的演算法。為驗證所提出的解法的效率,本研究運用隨機產生的範例進行實驗;數據實驗的結果顯示,本研究的解法較文獻中的啓發式演算法為佳。 |
英文摘要 |
In this study, we propose a new solution approach for solving the Maintenance Scheduling Problem for a Family of Machines (MSPFM). Goyal and Kusy (1985) presented the only model that used a nonlinear function for the cost of operating a machine in the literature of the periodic maintenance scheduling problems. Before presenting our solution approach, we first review Goyal and Kusy's (1985) mathematical model for the MSPFM and their heuristic for determining the economic maintenance frequency of a family of machines. To solve the MSPFM, we conduct full analysis on the mathematical model for the MSPFM. By utilizing our theoretical results, we propose an efficient search algorithm that solves the optimal solution for the MSPFM within a very short run time. Based on our random experiments, we conclude that the proposed search algorithm out-performs Goyal and Kusy's (1985) heuristic. |
主题分类 |
工程學 >
工程學總論 |
参考文献 |
|