arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2411.04685cs.AI
收藏

利用网络流模型解决细胞制造系统中的通用分组问题

Solving Generalized Grouping Problems in Cellular Manufacturing Systems Using a Network Flow Model

Department of Mechanical Engineering, Khulna University of Engineering & Technology(库尔纳工程技术大学机械工程系);Department of Industrial Engineering and Management, Khulna University of Engineering & Technology(库尔纳工程技术大学工业工程与管理系);Thomas Lord Department of Computer Science, Viterbi School of Engineering, University of Southern California(南加州大学维特比工程学院托马斯·洛德计算机科学系);Department of Computer Science, American International University-Bangladesh(美国国际大学-孟加拉国计算机科学系)

Md. Kutub Uddin, Md. Saiful Islam, Md Abrar Jahin, Md. Saiful Islam Seam, M. F. Mridha

AI总结:

本文提出利用网络流模型解决细胞制造系统中多工艺路线的分组问题,通过最小化工艺路线相似性优化分组,同时提出二次分配编程和启发式方法用于机器细胞形成。

摘要:

本文聚焦于细胞制造系统中的通用分组问题,其中零件可能有多种工艺路线。受网络流算法广泛应用的启发,本文将通用分组的工艺路线家族形成建模为单位容量最小成本网络流模型。目标是最小化工艺路线家族内所需机器的相似性。所提模型无需预设形成的部分家族数量,可最优解决工艺路线家族形成问题。工艺路线家族形成是分层过程的第一阶段。第二阶段(机器细胞形成)提出二次分配编程和启发式方法。二次分配编程同时分配工艺路线家族和机器到预设的细胞数,以最大化总机器利用率。启发式方法用于机器细胞形成是分层性质的。一些测试问题的计算结果表明,二次分配编程和启发式方法得到相同结果。

英文摘要:

This paper focuses on the generalized grouping problem in the context of cellular manufacturing systems (CMS), where parts may have more than one process route. A process route lists the machines corresponding to each part of the operation. Inspired by the extensive and widespread use of network flow algorithms, this research formulates the process route family formation for generalized grouping as a unit capacity minimum cost network flow model. The objective is to minimize dissimilarity (based on the machines required) among the process routes within a family. The proposed model optimally solves the process route family formation problem without pre-specifying the number of part families to be formed. The process route of family formation is the first stage in a hierarchical procedure. For the second stage (machine cell formation), two procedures, a quadratic assignment programming (QAP) formulation, and a heuristic procedure, are proposed. The QAP simultaneously assigns process route families and machines to a pre-specified number of cells in such a way that total machine utilization is maximized. The heuristic procedure for machine cell formation is hierarchical in nature. Computational results for some test problems show that the QAP and the heuristic procedure yield the same results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑