Solving the parallel batching with machine preventive maintenance in Flexible Job Shop scheduling problem when minimizing makespan and total tardiness

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：57

、訪客IP：3.17.128.129

姓名

施政延(Zheng-Yan Shi) 查詢紙本館藏

畢業系所

工業管理研究所

論文名稱

(Solving the parallel batching with machine preventive maintenance in Flexible Job Shop scheduling problem when minimizing makespan and total tardiness)

相關論文

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

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

至系統瀏覽論文 (2027-7-31以後開放)

摘要(中)

這個研究討論的彈性零工式排程問題有許多限制。我們的研究與一般的彈性零工式排程問題的不同之處在於考慮了機器預防性維護和操作並行分批。在處理完工序後，機器上會產生堆積物。如果堆積物累積達到上限，機器就需要進行預防性維護，以清潔和保養機器。我們提出了一種解決這個雙目標排程問題的演算法。該演算法的初始族群可以通過隨機生成個體或部分利用可排程操作（）來形成，並且考慮了新型操作限制，稱為機器預防性維護。我們提出了新的鄰域結構，用於處理堆積物和機器預防性維護。同時，我們提出了新的高效搜索策略，以找到更好的解決方案。目標是最小化兩個標準，即最小化總遲延和完成時間。

摘要(英)

The flexible job shop scheduling problem discussed in this study has many restrictions. The difference between our research and the general flexible job shop scheduling problem is that the machine preventive maintenance and operation parallel batching has been considered. After processed operations, deposits will be generated on the machine. If the accumulation of deposits reaches the upper limit, the machine needs to do the preventive maintenance to clean and maintain the machine. We propose an algorithm for solving this bi-objective scheduling problem. The initial population of this algorithm is formed by either randomly generating individuals or partially generating them by utilizing schedulable operations (omega), and considered the new type operation constraint called machine preventive maintenance. The new neighborhood structure for deposits and machine preventive maintenance is proposed. The new and efficient search strategy is proposed to find a better solution. The objective is the minimization of two criteria, minimize the total tardiness and the makespan.

關鍵字(中)

★ 彈性零工式排程問題
★ 局部搜索
★ 預防性維護

關鍵字(英)

★ flexible job shop scheduling
★ preventive maintenance
★ local search

論文目次

摘要 2
Abstract 3
Contents 4
List of figures 5
List of tables 6
1. Introduction 1
1.1. Research motivation and background 1
1.2. Problem description 2
1.3. Research objectives 3
1.4. Research methodology 4
2. Literature review 5
2.1. Flexible job-shop scheduling problem 5
2.2. Machine preventive maintenance 6
2.3. Neighborhood structure 7
2.4. Search strategy 7
3. Methodology 9
3.1. Disjunctive Graph Modeling 10
3.2. Initial solution 11
3.3. Neighborhood structure 12
3.3.1. An integrated move 12
3.3.2. CET move (critical end transpose) 13
3.3.3. CEI move (critical end insert) 14
3.3.4. Modified CET move (critical end transpose) 14
3.3.5. Modified CEI move (critical end insert) 15
3.3.6. CET+2MT move 15
3.3.7. Feasibility checking 17
3.3.8. Lower bounds on Makespan Cmax 17
3.4. Search strategy 23
4. Experiment result 25
4.1. Instance and parameter 25
4.2. Analysis of the integrated move with lower bound and steepest descent 25
4.3. Advantage of the two critical paths 27
4.4. Analysis of the integrated move and CEI, CET 29
5. Conclusion 32
Reference 33

參考文獻

Asefi, H., Jolai, F., Rabiee, M., Tayebi Araghi, M. E., 2014. “A hybrid NSGA-II and VNS for solving a bi-objective no-wait flexible flowshop scheduling problem.” The International Journal of Advanced Manufacturing Technology, 75(5), 1017-1033.
Bierwirth, C., Kuhpfahl, J. ,2017. “Extended GRASP for the job shop scheduling problem with total weighted tardiness objective.” European Journal of Operational Research, 261(3), 835-848.
Dauzère-Pérès, S., Paulli, J., 1997. “An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search.” Annals of Operations Research, 70, 281-306.
Deb K., Member A., Pratap A., Agarwal S., and Meyarivan T., 2002. “A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II.” IEEE TRANSACTIONS
Dell’Amico and Trubian M., 1993. “Applying tabu search to the job-shop scheduling problem.” Annals of Operations Research, 41(3):231-252, 1993.
García-León, A. A., Dauzere-Peres, S., Mati, Y. 2019. “An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria.” Computers & Operations Research, 108, 187-200.
Jomaa, W., Eddaly, M., Jarboui, B., 2021. “Variable neighborhood search algorithms for the permutation flowshop scheduling problem with the preventive maintenance.” Operational Research, 21(4), 2525-2542.
Knopp, S., Dauzère-Pérès, S., & Yugma, C. 2017. “A batch-oblivious approach for complex job-shop scheduling problems.” European Journal of Operational Research, 263(1), 50-61.
Kuhpfahl J., Bierwirth C., 2016. “A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective.” Computers & Operations Research. 66, 44-57.
Lee, C. Y., Chen, Z. L., 2000. “Scheduling jobs and maintenance activities on parallel machines.” Naval Research Logistics (NRL). 47(2), 145-165.
Liao, W., Pan, E., , Xi, L. , 2010. “Preventive maintenance scheduling for repairable system with deterioration.” Journal of Intelligent Manufacturing, 21(6), 875-884.
Manne, A. S., 1960. “On the job-shop scheduling problem.” Operations research. 8(2), 219-223.
Matsuo H., Suh C. J., and Sullivan R. S., 1988. “A controlled search simulated annealing method for the general jobshop scheduling problem.” Working paper 03-04-88. University Texas.
Mati Y., Dauzere-Peres S., and Lahlou C., 2011. “A general approach for optimizing regular criteria in the job-shop scheduling problem.” European Journal of Operational Research.
McCall, J. J., 1965. “Maintenance policies for stochastically failing equipment: a survey." Management science, 11(5), 493-524.
Mokhtari, H., Mozdgir, A., Kamal Abadi, I. N., 2012. “A reliability/availability approach to joint production and maintenance scheduling with multiple preventive maintenance services.” International Journal of Production Research, 50(20), 5906-5925.
Moradi, E., Ghomi, S. F., Zandieh, M., 2011. “Bi-objective optimization research on integrated fixed time interval preventive maintenance and production for scheduling flexible job-shop problems.” Expert systems with applications, 38(6), 7169-7178.
Naderi, B., Zandieh, M., Fatemi Ghomi, S. M. T., 2009. “Scheduling sequence-dependent setup time job shops with preventive maintenance.” The International Journal of Advanced Manufacturing Technology, 43(1), 170-181.
Naderi, B., Zandieh, M., Fatemi Ghomi, S. M. T., 2009. “A study on integrating sequence dependent setup time flexible flow lines and preventive maintenance scheduling.” Journal of intelligent manufacturing, 20(6), 683-694.
Nowicki E. and Smutnicki C., 1996. “A fast taboo search algorithm for the job shop problem.” Management Science, 42(6):797-813.
Srinivas N. and Deb K., 1995. “Multiobjective function optimization using nondominated sorting genetic algorithms,” Evol. Comput., vol. 2, no. 3, pp. 221–248.
Van Laarhoven. P. J. M., 1988. “Theoretical and Computational Aspects of Simulated Annealing.” PhD thesis, Erasmus University Rotterdam.
Van Laarhoven. P. J., Aarts E. H., and Lenstra J. K., 1992. “Job shop scheduling by simulated annealing.” Operations Research, 40(1):113-125.
Vilcot G., Billaut J. C., 2007. “A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem.” European Journal of Operational Research.
Kuo, Y., 2023. “An extended batch-oblivious approach for flexible Job shop with batching and material consumption when minimizing the total weighted material consumed and makespan.” Master thesis, National Central University.

指導教授

沈國基(Guo-Ji Sheen)

審核日期

2023-7-20

推文