考量週期性產品遞送下派工法則之發展

Dynamic Job Shop Scheduling With Fixed Delivery Dates

許正一(I - Cheng Hsu)

指導教授 ： 劉正祥

國立屏東科技大學/管理學院/工業管理系所/碩士(2011年)

https://doi.org/10.6346/NPUST.2011.00083

摘要

本研究所考慮的問題是在零工式生產的環境下具有交貨週期限制的排程問題。實務上的生產環境，產品並非完工就能立即出貨，大部分有規劃的運送週期。因此，如何讓工作的流程時間縮短並在適當的交貨週期中運送，避免成本增加是一個實務上需要加以探討的議題。針對此議題本研究嘗試發展適用於週期排程的派工法則，主要目的在使訂單的交期成本及提前完工成本兩者相加的總成本最小化，並且利用物件導向的模擬軟體Plant Simulation 9.0來建構模擬模式進行實驗及評估各類派工法則的績效表現。經實驗證明本研究所發展的派工法則能有效降低週期排程的總成本，並能提供相關生管人員派工的依據。

關鍵字

交期成本 ； 提前完工成本 ； 派工法則 ； 週期排程

並列摘要

In most classical scheduling models, it is assumed that a job is delivered to a customer immediately after its processing completes. In many practical situations, however, there are multiple delivery dates, where the time interval between any two consecutive delivery dates is constant. This kind of fixed delivery strategy results in substantial cost saving in transportation and handling. In this study, we are interested in scheduling the jobs in a dynamic job shop environment such that the sum of the total due-date cost and the total earliness penalty is minimized. The due date cost for a job is incurred for the time taken to deliver the job to the customer. Earliness penalty for a job is incurred from the time the job completes processing until it is delivered. In this study, we modify three well-known dispatching rules by explicitly considering different due date cost per time unit and earliness penalty per time unit of a job. Simulation results show that the proposed dispatching rules are significantly better than their original counterparts. In addition, the proposed rules are simple and easy to implement without preliminary runs for parameter estimation.

並列關鍵字

Fixed interval delivery ； Scheduling ； Job shop

參考文獻

1. 王治平，「實際零工式生產排程問題的派工法則」，國立政治大學資訊

1. A. Hertz and M. Widmer, An improved tabu search approach for solving the job shop scheduling problem with tooling constraints, Discrete Applied Mathematics, Vol.65, 1996, pp. 319-345.

2. B. Yagmahan and M. M. Yenisey, Ant colony optimization for multi-objective flow shop scheduling problem, Computers & Industrial Engineering, Vol.54, 2008, pp. 411-420.

3. C. H. Liu, A coordinated scheduling system for customer orders scheduling problem in job shop environments, Expert Systems with Applications, Vol.37, 2010, pp.7831-7837.

4. C. Y. Lee and C. L. Li, On the fixed interval due-date scheduling Problem, Discrete Applied Mathematics, Vol.68, 1996, pp.101-117.