透過您的圖書館登入
IP:3.133.119.66
  • 學位論文

具維修作業之雙平行機台排程問題

Two Parallel Machines Scheduling Problem With Maintenance Activities

指導教授 : 楊達立
若您是本文的作者,可授權文章由華藝線上圖書館中協助推廣。

摘要


時代的進步帶動著工商業的發達,各行各業的工廠機器均逐步走向自動化,以取代傳統的人工技術,藉著多台機器以及順暢的製造流程,產品製造的速度比起以往的人工可以快上幾十、甚至百倍,產品品質的穩定度也大大提升。 製造過程中各個工作流程的排序方式以及派工,都會影響到產品最後完工的時間,然而製造者無不希望以最快的速度來完成工作的完工時間。機器在不斷的運作中難免會發生故障需要進行維修,以維持工作流程的順暢並順利完工。 本研究即是針對維修時間固定(rate-modifying maintenance activities)之維修模式,考慮相同平行機台(identical parallel machine)之生產排程問題,先前的研究已經解決全部完工時間總和(total completion time)及全部機台負荷時間總和(total machine load)的問題,本研究將針對機台之最大完工時間(makespan)目標最小化下,設計啟發式演算法,並提出電腦模擬分析結果。

並列摘要


As the development of industrial and commercial progress led the contemporary life, plant machinery of all walks of life are gradually moving towards automation, replacing the traditional manual techniques by multiple machines and smooth manufacturing process. Nowadays, manufacturing speed is faster than previous artificial can dozens, even hundreds of times, and the stability of the product quality is greatly enhanced. Sort of workflow as well as dispatching, will influence the product manufacturing process and the final completion time. however, the manufacturer wish to finish the manufacturing process as soon as possible. Machine in continuous operation will inevitably malfunction so it need to be repaired in order to maintain the work flow smoothly and successfully. In this study, we foucus on two repair models : “the rate-modifying activities” and “deteriorating maintenance activities”. Then we consider the two models above respectively with two different production schedules: “identical parallel machine” and “unrelated parallel-machine”. As the previous studies have been resolved the problem of total completion time and total machine load, this study tends to present our argument not only with theoretical analysis but also with all the machine makespan done by computer simulation.

參考文獻


[2] 沈育安,2005,“以模擬為基礎之啟發是演算法求解平行機台排程問
[3] 陳奕帆,2009,“運用基因演算法解決流程式人力分配排程問題”,國
[4] 熊詩敏,2007,“結合優勢性質與基因遺傳演算法於具有整備時間之單
[5] Aleksei V. Fishkin , Klaus Jansen , and Monaldo Mastrolilli , 2001,
"Grouping techniques for scheduling problems: simpler and faster",

延伸閱讀