Solving a multi-criteria group scheduling problem for a cellular manufacturing system by scatter search

Abstract

This article presents a group scheduling problem for manufacturing cells, in which parts may visit different cells. By addressing intra-cell scheduling, the sequence of parts within manufacturing cells is determined; however, in inter-cell scheduling, the sequence of cells is obtained. A novel mathematical model is presented for a multi-criteria group scheduling problem in a cellular manufacturing system with respect to a design objective function minimizing the makespan and costs of intra-cell movement, tardiness, and sequence-dependent setup, simultaneously. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditional approaches and optimization tools is extremely difficult. Thus, we develop a meta-heuristic algorithm based on scatter search (SS) to solve the foregoing model. The related results confirm the efficiency and effectiveness of our proposed SS algorithm, which finds good solutions, especially for medium- and large-sized problems.

摘要

本文提出一個製造單元群組排程問題 ， 其零件可能拜訪在不同的單元。 藉由單元內部的排程 ， 零件在單元內的順序可以確定 ； 藉由單元間的排程 ， 單元的順序可以取得。 一個應用於單元製造系統(CMS)多準則群組排程問題之新數學模型被提出來 ， 其目標函數包含了同時最小化最大完工時間、 單元內的移動、 延遲和相依整備時間。 使用傳統方法和優化工具在合理的計算時間內 ， 對這複雜且大型規模的問題來求取最佳解是非常困難的。 因此 ， 我們開發一個以分散式搜尋法(SS)為基礎的萬用啟發式演算法來解決上述的模型。 相關的結果證實我們所提出的分散式搜尋法可以有效地且有效率地找到好的答案 ， 特別是針對中型和大型的問題。

(*聯絡人: [email protected])

Keywords:

• cellular manufacturing system
• sequencing-dependent setup
• makespan
• tardiness
• scatter search

Keywords:

• 關鍵詞： 單元製造系統 ， 順序相依設置 ， 完工時間 ， 延遲 ， 分散式搜尋

Notes

(*聯絡人: [email protected])