在自動化製造系統具有多製程工件之排程問題探討

Proecss Plan Selection for Parts Scheduling in Automated Manu- facturing Systems

方鐘慶(Chung-Ching Fang)

指導教授 ： 張百棧

元智大學/工程學院/工業工程與管理學系/碩士(1992年)

摘要

本研究主要在探討自動化製造加工系統中，具有多製造途程之工件排程問
題研究。對每一加工途程，每一個工件可能需要特別工具或其它輔助器材
，如夾具、鎖緊工具及供應器具等等。這些工件可以透過適當排程使得整
體之製造加工成本最低。而此製造加工成本包含了製造途程加工成本及漢
明成本（Hamming distance）用來測量連續被加工兩工件間之製程差異性
，差異性越大成本越高 )。本研究不同於 Kusiak 及 Finke 提出之二階
段考慮法：即先解決每組工件之途程選擇問題，再考慮如何將這些工件排
程到機台上，而是以排程為主來考慮如何將這些具有多製造途程之工件安
排到機台上加工而使得總體之製造成本最低。換句話說本研究嘗試將途程
挑選階段與排程階段合併為一階段，以縮短計劃時間且使生產製造之成本
最低。對於本問題將以數學規劃模式加以探討，並使用動態規劃之解題方
式以求最佳解，同時由於問題之複雜度，將發展一套有效之啟發式解法以
解決大的問題，另外對模擬結果之實驗數據也將加以詳細討論。

關鍵字

製造途程 ； 排程 ； 啟發式 ； 漢明成本

並列摘要

In this research , a set of parts with alternative process
plans to be scheduled in an automated manufacturing system are
considered . For each process plan , the part may require spe-
cific types of tool and auxiliary devices such as fixtures ,
grippers ,and feeders . The system objective is to schedule the
setof parts with the minmum manufacturing cost . The manufact-
uring costs includes the process plan cost and Hamming distance
cost . The Hamming distance cost measures the dissimiliarily
between process plans for successive parts . Instead of sele-
cting the process plan alone as attacked by [Kusiak and Finke]
for the set of part then schedules , we take a different appro-
ach by considering the scheduling of the set of parts with al-
ternative process plans in minmizing the manufacturing cost .
The problem is formulated using a mathematic programming model
and a dynamic programming solution method is proposed to solve
the problem in optimality , however , owing to the complexity
of the problem , a heuristic approach is also developed to
slove the problem in practical sizes . Finally ,numerical
results of the heuristic are also discussed.

並列關鍵字

process plan ； schedule ； heuristic ； Hamming distance