Scheduling Algorithms and Sensitivity Analysis for Heterogeneous Batch Processors with Incomp Atible Job Families

不相容工件族之異質批次處理器的排程演算法與敏感度分析

M. Mathirajan ； Appa lyer Sivakumar ； Vijay Chandru

《工業工程學刊》 21卷1期 (2004/01) Pp. 18-26

https://doi.org/10.29977/JCIIE.200401.0002

摘要

吾人考慮非單一工件大小、動態工件來到與不相容工件族狀況下的異質批次處理器排程問題。本研究源於鋼鐵鑄造業中預鑄階段的熱處理作業。吾人提出一些以最大化批次處理器平均使用率為排程目標的啓發式演算法。實驗結果顯示所有提出的啓發式方法可以產生非常近似最佳的批次處理器平均使用率。吾人進一步做敏感度分析，並且觀察到輸入參數的改變會影響啟發式方法的成效。接著，吾人利用統計方法驗證參數改變的影響。最後，吾人發現參數的改變對於最佳演算法的選擇沒有顯著的影響。

關鍵字

異質批次處理器 ； 不相容工作族 ； 啓發式演算法 ； 敏感度分析

並列摘要

We consider the problem of scheduling heterogeneous batch processor under the conditions non-identical job sizes, dynamic job arrivals and incompatible job families. The problem studied in this paper is motivated by heat-treatment operations in the pre-casting stage of steel casting manufacturing. We proposed a few heuristic algorithms with maximizing the average utilization of batch processors as scheduling objective. From the computational experiments carried out, it appears that all the proposed heuristics are yielding very close to the optimum (estimated optimum) average utilization of the batch processors. Further, we carried out a few simple sensitivity analyses. From sensitivity analysis, in general, it appears that there is an influence on the performance of the proposed heuristic algorithms when the input parameter changes. The influence observed is further verified statistically. Finally, it is observed that with respect to the scheduling objective, the choice of the best algorithm(s) do not significantly affected due to changes in the parameters considered.

並列關鍵字

heterogeneous batch processors ； incompatible job-families ； heuristic algorithms ； sensitivity analysis

參考文獻

Azizoglu, M.,S. Webster(2001).Scheduling a batch processing machine with incompatible job families.Computers and Industrial Engineering.39,325-335.

Dobson, G.,R. S. Nambimadom(2001).The batch loading and scheduling problem.Operations Research.49(1),52-65.

Duenyas, I.,J. J. Neale(1997).Stochastic scheduling of a batch-processing machine with incompatible job families.Annals of Operations Research.70,191-220.

Fanti, M. P.,B. Maione,G. Piscitelli,B. Turchiano(1996).Heuristic scheduling of jobs on a multi-product batch-processing machine.International Journal of Production Research.34(8),2163-2186.