考量平行機台彈性以及惡化維護求極小化總完工時間之排程問題

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：19

、訪客IP：18.217.110.0

姓名

王凱弘(Kai-Hung Wang) 查詢紙本館藏

畢業系所

工業管理研究所

論文名稱

考量平行機台彈性以及惡化維護求極小化總完工時間之排程問題
(Parallel machine scheduling with flexible and deteriorating maintenance activities for minimizing the total completion time)

相關論文

★ 以類神經網路探討晶圓測試良率預測與重測指標值之建立	★ 六標準突破性策略—企業管理議題
★ 限制驅導式在製罐產業生產管理之應用研究	★ 應用倒傳遞類神經網路於TFT-LCD G4.5代Cell廠不良問題與解決方法之研究
★ 限制驅導式生產排程在PCBA製程的運用	★ 平衡計分卡規劃與設計之研究-以海軍後勤支援指揮部修護工廠為例
★ 木製框式車身銷售數量之組合預測研究	★ 導入符合綠色產品RoHS之供應商管理-以光通訊產業L公司為例
★ 不同產品及供應商屬性對採購要求之相關性探討－以平面式觸控面板產業為例	★ 中長期產銷規劃之個案探討 -以抽絲產業為例
★ 消耗性部品存貨管理改善研究-以某邏輯測試公司之Socket Pin為例	★ 封裝廠之機台當機修復順序即時判別機制探討
★ 客戶危害限用物質規範研究-以TFT-LCD產業個案公司為例	★ PCB壓合代工業導入ISO/TS16949品質管理系統之研究-以K公司為例
★ 報價流程與價格議價之研究–以機殼產業為例	★ 產品量產前工程變更的分類機制與其可控制性探討-以某一手機產品家族為例

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

至系統瀏覽論文 ( 永不開放)

摘要(中)

本研究考慮在彈性維護以及惡化維護的限制之下，n 個不可分割的工作以及 m 台平行機台並求解最下化總完工時間。在本文中的排程問題，機台的狀態非連續可用的，意旨機台在連續工作一段時間後，必須進行機台的維護以避免機台發生故障以及提升機台加工作業的品質。在以前的研究方向中，機台的維護以周期維護為主要研究，即所謂機台使用一段固定時間後必須進行維護作業，而近幾年為了提升機台的使用效率，發展出彈性維護周期的限制，意旨為在兩個連續維護作業的之間時間是不固定的，即每一次機台維護的開始時間是不確定的，本研究設立機台最小連續工作時間以及最大連續工作時間來符合彈性維護周期的限制。而除了彈性維護限制之外，為了更加符合實際工廠的環境，加了一項惡化維護的限制，意旨執行維護的時間會根據經過多久加工時間而變化，即上一次維護作業結束若經過較長的加工時間則下一次執行維護作業的時間則會加長，反之亦然。
我們提供分枝界限演算法來尋求本問題的最佳解，並且根據本文中五個propositions 以及lower bound 和upper bound 來提升演算法的效率，最後則是將使用電腦計算出問題的最佳解。

摘要(英)

In this paper we consider the problem of scheduling of n nonresumable jobs on m identical parallel machines with deteriorating and flexible maintenance activities, and the objective is to minimize total completion time. In this paper scheduling, each machine is not continuously available. The machine must be maintained to prevent breakdown of machine and keep the quality of process jobs. In the past studies, the period maintenance activities is the main object. The period maintenance activity must be maintained after it continuously working for a period of time. In a recent year, develop to constraint of flexible maintenance in order to promote the efficient of machines. The flexible maintenance which means the starting time of unavailability period are decision variable together with jobs to be scheduled .This study given the minimum and maximum working time within any two consecutive maintenance activities correspond with flexible maintenance activity . In addition to constraint of flexible maintenance, correspond with manufacturing environment, we add the constraint of deteriorating maintenance. The deteriorating maintenance assume that the duration of each maintenance activity time depends on the running time.
We propose a branch and bound algorithm to find the optimal solution. According to five propositions, lower bound and upper bound to promote the efficient of algorithm. Finally, we use computational analysis to calculate the optimal solution.

關鍵字(中)

★ 排程
★ 平行機台
★ 機台彈性維護
★ 機台惡化維護
★ 總完工時間
★ 分枝界限法

關鍵字(英)

★ Scheduling
★ Parallel machines
★ Flexible maintenance
★ Deteriorating maintenance
★ Total completion time
★ Branch and bound

論文目次

摘要 I
Abstract ii
Table of Content iii
List of Figures iv
List of Tables v
Chapter 1 Introduction 1
1.1 Background and motivation 1
1.2 Problem description 3
1.3 Research objectives 4
Chapter 2 Literature review 6
2.1 Machine with flexible maintenance activity 6
2.2 Machine with deteriorating maintenance activity 8
2.3 Relationship with flexible and deteriorating maintenance activity 10
Chapter 3 Methodology for the scheduling problem 13
3.1 Notation 13
3.2 Basic propositions 14
3.3 Branching scheme 20
3.4 Bounding scheme 25
3.4.1 Lower bound 25
3.4.2 Upper bound 27
3.5 Algorithm. Branch and bound algorithm 28
Chapter 4 Computational analysis 33
4.1 Generating test problem 33
4.2 Validation of the branch and bound algorithm 34
4.3 Performance of the branch and bound algorithm 35
Chapter 5 Conclusion 44
5.1 Research contribution 44
5.2 Research limitation 45
5.3 Further research 45
References 46
Appendix 49

參考文獻

[1]Chen J. S. (2008) “ Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan ” , European Journal of Operational Research , 190 , 90–102
[2]Hsu C.J. , D.L. Yang and T.C.E Cheng (2011) “ Unrelated parallel-machine scheduling with deteriorating maintenance activities ” , Computers & industrial engineering , 60 , 602–605
[3]Hsu C.J. , M. Ji , J.Y. Guo and D.L. Yang. (2013) “ Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities ” , Information Sciences , 253 , 163-169
[4]Low C. , M. Ji , C.J. Hsu and C.T. Su (2010) “ Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance ” , Applied Mathematical Modelling , 34 , 334–342
[5]Mor B. and Mosheiov G. (2015) “ Scheduling a deteriorating maintenance activity and due-window assignment ” , Computers &Operations Research , 57 , 33–40
[6]Mellouli R. , C. Sadfi, C. Chu and I. Kacem (2009) “ Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times “ , European Journal of Operational Research , 197 , 1150–1165
[7]Sbihi M. and C. Varnier (2008) “ Single-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness ” , Computers & Industrial Engineering , 55 , 830–840
[8]Tan Z. , Y. Chen and A. Zhang (2013) “ On the exact bounds of SPT for scheduling on parallel machines with availability constraints “ , Int. J. Production Economics ,146 , 293-299
[9]Wang J.B. and C.M. Wei (2011) “ Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties ” , Applied Mathematics and Computation , 217 , 8093–8099
[10]Yang S.L. , T. Ma , D.L. Xu and J.B. Yang (2011) ” Minimizing total completion time on a single machine with a flexible maintenance activity “ , Computers & Operations Research , 38 , 755–770
[11]Yang S.J. and D.L. Yang (2010) ” Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities “ , Computers and Mathematics with Application , 60 , 2161–2169
[12]Yang S.J. , D.L. Yang and T.C.E Cheng (2010) “ Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance “ , Computers & Operations Research , 37 , 1510–1514
[13]Yang S.J. , C.J. Hsu and D.L. Yang (2012) ” Note on Unrelated parallel-machine scheduling with deteriorating maintenance activities “ , Computers and Industrial Engineering , 62 , 1141–1143
[14]Yang D.L. , T.C.E Cheng , S.J. Yang and C.J. Hsu (2012) “ Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities “ , Computers & Operations Research , 39 , 1458-1464
[15]Yang S.J. (2013) “ Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time “ , Applied Mathematical Modeling “ , 37 , 2995-3005
[16]Yin N. , L. Kang , T.C. Sun , C. Yue and X.R. Wang (2014) “ Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times , Applied Mathematical Modelling “ , 38 , 4747–4755
[17]Li Y.H. (2014) “ Parallel Machine Scheduling with Flexible Maintenance Activity Periods for Minimizing Total Completion Time “ , Unpublished Master’s Thesis , National Central University Industrial Engineering and Management

指導教授

沈國基(Gwo-Ji Sheen)

審核日期

2016-7-27

推文