彈性流程式生產系統批量分割排程問題之研究

企業為了提升競爭力及滿足顧客的需求，同時生產多樣化的產品，每項產品也經由不同的流程加工。為了能夠達成交貨的目標，採取多部機器同時生產產品，而形成彈性流程式生產方式，且工件分割為數個子批同時在不同的機器上操作也在實務上經常發生，過去研究在此較少著墨，考慮的因素經常過於簡化。因此本研究將探討在彈性流程式的生產系統下考慮將工件分割同時操作，其中考量完全相同平行機器、相依整備時間及整數解。　　派工法則使用的難易度低及在求解的時間上有良好的表現，實務上也經常使用，而在考慮工件分割的情況下，並無一套方式來決定派工法則之後應該使用機器數量。本研究將使用派工法則及發展決定適當的機器使用數方法。目標為降低工件延遲比率。實驗經由大量數據模擬，考慮不同的工件數量、跳站率、工作站數量、工作站內機器數、生產單位數量、單位處理時間、產品種類、整備時間及交期鬆緊因子，使用18個派工法則上配合不同工件機器使用數量方式，以C#程式語言撰寫模擬程式，每一情境組合均進行30次的模擬，將結果轉換成相對績效指標進行分析。　　在經由大量數據模擬後，得到以派工法則STSLACK/OP配合變動式分割方式，在大部分的情況下，平均為最佳的結果，而變動式分割相較於固定機器使用上限的方法上，有較良好的表現。在求解速度方面也相當迅速平均為155.63毫秒。本研究結果相信能提供理論研究者、現場工程師及生產管理系統開發商參考價值。

關鍵字

批量分割；派工法則；彈性流程式生產

並列摘要

In order to enhance competitiveness, companies usually adopt diversified production strategies to fulfill the sundry demands of customers. Flow shop is a common manufacturing type. The products are processed via different procedures in the environment. In order to improve capacity and deliver goods on time, adding multiple machines at the same stage is a popular strategy adopted by manufacturers. For this reason, the manufacturing type is turning flow shop into flexible flow shop. And a job is split apart into several lots and operated on multiple machines at the same time often taken place on the practice. However, the literature of lot-splitting is actually rare on this question. Therefore, this research studies the flexible flow shop scheduling problem with lot-splitting and sequence-dependent setup times. Dispatching rules are easy to use and have good efficiencies. Hence, dispatching rules are often used in practice. But under the situation of lot-splitting, for my best knowledge, there are no methods can determine how many machines that must be used at present. Therefore, this research will use dispatching rules and develop one algorithm which can decide how many machines will be used at each scheduling decision. The objective is to optimize the number of tardy jobs. The experiment considers several factors such as number of jobs, skipping the stage rate, number of stages, number of machines in the stage, number of products, processing times, product types, setup time and due-date tightness. Eighteen dispatching rules are also examined in the research. All algorithms are implemented by C# program language. The experiment results show the dispatching rule STSLACK/OP with the variation splitting method is the best algorithm in most conditions. In addition, the variation splitting method is the best number of machines deciding method. The algorithm is very efficient and the average computational time of the algorithm is 155.63 millisecond. We believe the results of research can help theory researchers, field engineers, developers of production management system to reference.

並列關鍵字

Lot-Splitting ； Dispatching Rule ； Flexible Flow Shop

參考文獻

1. Allahverdi, A. & Gupta, J. N. D. & Aldowaisan, T., 1999. “A review of scheduling research involving setup considerations,” Omega, Vol.27, pp.219-239.

2. Allaoui, H. & Artiba, A., 2004. “Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints,” Computers and Industrial Engineering Vol.47, Issue: 4, pp.431-450.

3. Anghinolfi, D. & Paolucci, M., 2007. “Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach,” Computers and Operations Research, Vol.34, pp.3471-3490.

5. Azizoglu, M. & Kirca, O., 1999. “On the minimization of total weighted flow time with identical and uniform parallel machines,” European Journal of Operational Research, Vol.113, Issue: 1, pp.91-100.

6. Brucker, P. 2007. Scheduling Algorithms, Fifth Edition, pp1-2.

國際替代計量

彈性流程式生產系統批量分割排程問題之研究

未授權

主題瀏覽