跳躍式不允許等待生產線排程方法之研究

Abstract

本論文探討JNWF的排程問題。JNWF排程問題是限制工件在生產過程中不能有等待機台的情況發生，且各工件經過機台的先後順序相同，但依工件的不同，加工過程中可能會跳過某些機台加工。本研究根據JNWF排程問題的特性，以總排程時間最小化為目標。利用禁忌搜尋法(tabu search)提出演算法(FBS、FBS2)，求解各工件佔用機台的優序。本研究針對FBS、FBS2，李氏的TS2及蔡氏的ITS四種求解JNWF排程問題方法，分別就起始解、最終解，及運算時間的績效進行比較。結果顯示，在起始解及最終解的總排程時間顯著優於TS2及ITS，唯在運算時間及機台數較少的情境，無顯著差異。

This study investigates the scheduling of jumping no-wait flowshop(JNWF) problems. These problems have a constraint that jobs can not wait for machine during production process; the sequencing of jobs by the machine is similar, but due to the difference of jobs' types, jobs may skip some process of machines. This research is based on the specific of JNWF sequencing problems, with the minimum makespan as the target. By deriving 2 new algorithms (FBS and FBS2) from tabu search, we determine the priority of the jobs from the machine. 4 methods (FBS, FBS2, Li’s TS2 and Tsai’s ITS) are compared in terms of initial solution, final solution and computed time. It is found that FBS and FBS2 are significantly better than TS2 and ITS in terms of initial and final solution, but there is not much difference between these 4 methods in terms of computed time and during scenario when lesser machines are used.