發展啟發式雙向排程法於流線型工廠之研究

在流線型工廠中，工作的延誤將造成生產紊亂，及客戶對訂單交期滿意度下降，所以有效的降低流線型工廠中的總延遲時間便成為一個關注的課題，而一般正向排程是將工作一個接一個往後去排定生產，不恰當的排序容易造成交期的延誤，而逆向排程是由工作的交期去往前逆推，逆向排程可能將工作的開始時間逆推到過去的時間點，而讓整個生產排程變得不可行，為了改善上述2種排程方式的缺失，所以本研究就發展啟發式雙向排程法，在逆向排程時設法讓完工時間最小化，希望在經過完工時間最小化的逆向排程後，能有效的縮短完工時間，之後轉成正向排程後，能有效的縮短總延遲時間。本研究建構出啟發式雙向排程法、修正到期日、最早到期日模型，將本研究之模型與修正到期日模型及最早到期日模型做實驗與結果的分析，實驗分為抵達時間為零、抵達時間變異小、抵達時間變異大等三種實驗並變化不同之到期日設定，機器數、工作件數等實驗條件。由實驗結果得知本研究所提啟發式雙向排程法在抵達時間為零及抵達時間變異小的生產環境中，能有效減少總延遲時間。

關鍵字

正向排程；逆向排程；流線型工廠；模擬

並列摘要

In the flow shop, the work delay will creates the production disorder,and the customer drops to the order due date degree of satisfaction.Therefore effective reduces the total delay time become a attention the topic in the flow shop，but the work will be scheduling one by one in the general forward scheduling,it easy to make the due date delay. But backward scheduling will be proceeds by the work due date counter to push, the backward scheduling probably let works beginning time forward to past time,but lets entire production scheduling become infeasible.In order to improve the above two platoon demerit.Therefore this research develops the heuristic bi-directional scheduling algorithm,try to let the makespan minimum in the backward scheduling.Hope after completion time minimum process of backward scheduling.Can effective reduction the makespan. After transfers forward scheduling.Can effective reduction total tardiness time. This research develop heuristic bi-directional scheduling,modify due date,early due date model,then use this research’s model , modify due date model,early due date model make analysis and experiment. The experiment divide into three parts，arrival time equal zero, arrival time small variably, arrival time large variably,and change different experiment conditions the set of due date,number of machines,number of jobs. The result shows that this research apply to arrival time equal zero or arrival time small variably production environment,can effective reduction total tardiness time.

並列關鍵字

Forward Scheduling ； Backward Scheduling ； Flexible Flow Shop ； Simulation

參考文獻

[7] Ali, A. “The two- and m-machine flowshop scheduling problems with bicriteria of makespan

[8] Alidaee, B. , and Rosa, D. , “Scheduling parallel machines to minimize total weighted And

1999.

[11] Johnson, S.M. , “Optimal two- and three-stage production schedules with setup times

[12] Kim, Y. D. “A backward approach in list scheduling algorithms for multi-machine tardiness

國際替代計量

發展啟發式雙向排程法於流線型工廠之研究

未授權

主題瀏覽