本研究主要在探討零工工廠在動態生產排程中最常面臨之"訂單異動"問題 ,如機器損壞, 停工待料,員工請假,緊急插單等,我們將歸納出訂單 異動之原因,及其對原有排程 (Original Schedule) 之衝擊,再發展一 迅速有效之主動反應式排程法則,以處理因訂單 異動所造成之干擾。而 在訂單異動之處理方法上,我們可以仿效在MRP?佴鴭韞~界干擾所常用到 兩種方法(1)為淨變法(NET CHANGE)及(2)再生法(REGENERATE)。淨變法之 再排程方法所需時間較短,然而所得到是一近似解,而再生法則可得到較 佳解,然而所需時間較長,有時甚至得不到最佳解。本研究將使用MRP 理 論中,淨變法之觀念,提出變動順序排程調整法則,考慮在訂單異動問題 產生時,將受干擾工件重新排序之,所得之新排程與其他學者所提之固定 順序排程調整法更為優異,尤其在訂單延遲之控制上,本方法可得到相當 不錯的效果。另外就工廠最常見的緊急插單問題,本研究亦提出可行解決 方法,以提供一實際可行之主動反應式排程法則,來解決所有工作現場之 異常因素干擾。
This research is to investigate the most incurring problem , " the exchange ofthe manufacturing orders" , in the dynamic scheduling of the shop floor.As theresults , the causes and effects of these disturbances can be furthercategorized and analyzed . Therefor , the impacts of each disturbances to theoriginal schedule can be clearly identified . Then , a reactive schedulingalgorithm is to be developed to efficiently and efficiently resolve theimpacts caused by the disturbances on the shop floor. As the solution to theimpacts of the disturbances , we can mimic the logic applied in MRP, i.e., netchange, and regenerate. The computation time in net change is small while thesolution quality is rough and near-sighted . As in regenerate , the solutiontime is cos tly while the solution quality is closed to optimality . Base onthe " net change " in MRP , we will develop a "Change-Order" method. When "theexchange of manufacturing orders " happens , it can analyze the disturbancesand generate a new feasible schedule rapidly . This result is better thenusing the " Fix-Order " method . Especially on the control for the delayingorders . Also , we will find a feasible solution to clinch " rush orders "problems which factories are often incurring.