臺灣博碩士論文加值系統

　　本研究係探討以機器人為中心之製造單元排程問題，其中機器人負責
工件上／下料作業，同時工件之傳遞方式可以是依固定次序或隨排定之次
序來上料，在此排程問題中如何找出最佳之加工次序使其機器人的利用
率(Utilization) 達到最高，亦即如何安排工件之加工順序使其總完工時
間最短則是本論文之研究目標。　　本研究針對此排程問題提出一些性質
，並在融入這些相關性質後發展出一種應用表格形式階段演算技巧與分枝
界限法(Branch and Bound)觀念的最佳化排程方法，同時根據非延遲(
Non-delay) 排程之觀念亦發展出兩種不同的啟發式方法藉以迅速且有效
地用來解決此類問題，進而改善此製造單元之機器人的利用率，達到提昇
整體製造單元生產力之目標。

This research investigates the operation scheduling problem for
a robot-centered manufacturing cells, Robot is in charge of the
part loading and unloading from a CNC machine. In addition, the
parts can be transferred either in a pre-fixed sequence or a
random sequence for processing. The objective of this research
is to find an optimal sequence for parts to be processed on the
machine such that the makespan is minimizing. In this research
we provide properties and a branch and bound approach to find
optimal solution. In additions , according to the nondelay
concept and tabular scheduling method, this research also
presents two different heuristic algorithm. Through intensive
experimental tests, these two algorithms are very efficient and
effective in solving the problems.