考慮到達時間的最小化總完工時間之流程型工廠排程問題

The study of minimizing makespan with arrival dates on the flowshop scheduling problem

張荃銘(chuan-Ming Chang)

指導教授 ： 蘇玲慧

中原大學/電機資訊學院/工業與系統工程研究所/碩士(2020年)

https://doi.org/10.6840/cycu202000828

摘要

本研究以機械製造業的生產線為研究對象，擬針對其中五個關鍵道次進行排程分析，是屬於流程型工廠排程問題，目的為將原有以最早到達時間派工法則的生產排程方式進行改善，排程目標為最小化總完工時間，本研究利用加權指標改善原有的最早到達時間派工法則。本研究有n個訂單，每個訂單皆依照相同的道次執行加工，亦即依序在道次一、道次二、道次三依序加工。個訂單在各道次所需的的工作時間為已知，工件在每一道次中不可中途離開，亦不會有插件或暫停等狀況。
本研究建構以加權指標決定訂單順序的法則，經實驗共降低了平均總完工時間3.9天，平均改善率達3.47%，但相對也會因加入加權計算而增加求解時間0.3秒。

關鍵字

流程型工廠 ； 總完工時間 ； 派工法則 ； 到達時間

並列摘要

This research considers the problem of machinery manufacturing production line. The goal is to minimizing makespan for the five known rolling to improve the earliest arrival date rule. Using the weighted indices to improve the earliest arrival date rule, this research has five rolling and n orders. The machining can only be performed according to the known route. The working time of the workpiece is known, and the workpiece cannot be halfway in each pass. If you leave, there will be no plug-ins or pauses.
In this research, the weighted indices was constructed concerning to this problem. The average total makespan was reduced by 3.9 days, and the average improvement rate is 3.47%. However, the solution time was also increased by 0.3 seconds. The performance ratios of the heuristic algorithm and computational results are presented.

並列關鍵字

Flowshop ； Makespan ； Dispatching rule ； Earliest arrival date

參考文獻

1. Johnson﹐S.M. ﹐1954﹐Optimal two and three stage production schedules with set-up time included﹐Naval Reseach Quarterly,pp.61-68.

2. Yeh﹐W.C. ﹐2001﹐An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem﹐Journal of Manufacturing System,pp.113-123.

3. Gonzalez﹐T. ﹐Sahni﹐S. ﹐1978﹐Flowshop and jopshop schedules: complexity and approximation﹐Operations Research,pp.36-52.

4. Afzalirad﹐M.﹐& Rezaeian﹐J.﹐2016﹐Resource-constrained unrelated parallel machine scheduling problem with sequence dependent setup times﹐precedence constraints and machine eligibility restrictions﹐Computers & Industrial Engineering,pp.40-52.

5. Agarwal Anurag﹐Colak Selcuk﹐and Eryarsoy Enes﹐2006﹐Improvement heuristic for the flow-shop scheduling problem: An adaptive-learing approach﹐European Journal of Operational Research,64(3),801-15.