本研究探討兩階段彈性流程型工廠包含合批之排程問題,針對不同類型工件排列於第一階段非等效平行機台(Uniform Parallel Machines),再至第二階段非等效批次平行機台(Uniform Batch Parallel Machines)加工,而批次僅相同類型之工件可合批操作,以總完工時間最小化為目標。 本問題為NP-Hard問題,因此提出啟發式演算法,利用SPT-FOE法將工件分批,以似Backward方式排列批次於第二階段,再依第二階段批次虛擬開始時間排序工件於第一階段以最早完工之機台,以此為基礎並利用貪婪演算法修正機台閒置時間,提早工件完工時間而發展出啟發式演算法。
This research consider two-stage flexible flow shop with batching scheduling problem. This research have a different type of jobs scheduling, first stage is on uniform parallel machines and the second stage is process of uniform batch parallel machines. The batches only include jobs on the same type. The objective is to minimize the total completion time. This problem is shown to be NP-Hard, therefore propose a heuristic algorithms. First using SPT-FOE rule batching jobs to arranged batch in the second stage like Backward rule, then with taking the virtual start time of second stage of batch to assign jobs. Furthermore put the earliest completion time in the first stage machine. Basis on this, this research using greedy algorithm to reduce idle time of machine and early jobs of completion time to develop heuristic.