以啟發式演算法求解最小化加權總延遲時間之平行機台排程問題-以某生技公司生產排程為例

A Heuristic Algorithm for Total Weighted Tardiness Minimization on Parallel-Machine Scheduling Problem - A Case of Biotechnology Product Line

呂佳容(Chia-Jung Lu)

指導教授 ： 蘇玲慧

中原大學/工學院/工業工程研究所/碩士(2013年)

https://doi.org/10.6840/CYCU.2013.00082

摘要

本研究針對完全相同平行機(identical parallel machines)上之排程問題進行個案分析研究，研究目標為最小化總延遲時間。每筆訂單具有數個不同品項，每筆訂單具有抵達時間，訂單權重數與交期時間的限制。每筆訂單內的各個品項其抵達時間，訂單權重數與交期時間是一樣的。每筆訂單的完成時間是以最後一個品項完成時間為準，本研究發展一啟發式研究方法以求得一可以接受的解，並與以往所用的方法作比較，研究結果顯示本研究之啟發式方法可以得到不錯的解。
針對給與定訂的材料至完工順序流程行工廠之排程問題，且考量該產業之所有生產特性，就是考慮把工件延後至交期日完成，且下一個以及之後工件都可能提早處理而減少延遲時間或延遲的可能，去尋求方法而量身訂作適合的出貨排程系統為最大目標。

關鍵字

完全相同平行機

並列摘要

This research focuses on the scheduling problem of identical parallel machines to minimize the total tardiness. Each order has several different items, arrival time, weightings, and delivery time while each item of the order has the same arrival time, weighting, and delivery time. The finish time of each order is determined by the finish time of the last item in it. In the research an innovative heuristic meathod is developed to obtain an accepted answer and compares with methods used before.

For the scheduling problem of procedural sepuence factory from ordering material to complete finishing, by taking the production character of the industry into account, we consider postponing finishing one work to delivery date, and then the next and the after work may be done early to decrease the tardiness or possibility of delay. The purpose of this research is to find out the tailor-made scheduling system for delivery.

並列關鍵字

identical parallel machines

參考文獻

江珮甄，2005，以派工法則求解彈性流程式生產排程問題，國立台灣大學，碩士論文。

陳俊吉，2008，以啟發式方法解決具迴流性資源之彈性流程式排和問題，國立政治大學，碩士論文。

黃河川，2002，企業工作委外程度之影響因素分析－以國內生物科技廠商為列，國立成功大學，碩士論文。

Allahverdi, A., Ng, C.T., Cheng, T. C. E., and kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational research, 187, 985-1032.

Baker, K. R. and Scudder, G. D.(1990). Sequencing with earliness and tardiness penalties.