检索结果-内蒙古大学图书馆

Harmony search algorithm for simultaneous minimization of bi-objectives in multi-row parallel machine layout problem

引用

EVOLUTIONARY INTELLIGENCE 2021年第4期14卷 1495-1522页

作者： Lenin, N. Kumar, M. Siva Vel Tech Rangarajan Dr Sagunthala R&D Inst Sci & Mech Engn Chennai 600062 Tamil Nadu India

The manufacturing cost of products and productivity mainly depends on the arrangements of manufacturing facilities on the shop floor. The process of designing a good layout ensures the relative positions of different types of machines to satisfy the objectives of the manufacturers. Probably, the arrangement of machines in a single row with considering duplicate machines and forward flow of materials under a multi-product environment is providing better solutions to the manufacturers in view of satisfying the objectives. Since the usage of duplicate machines in a single row machine layout, the investment cost on machines is high along with the requirement of a lengthy space. In addition to that, the forward flow of materials is resulting from an increase in the flow distance of products. In view of eliminating these two constraints, the laying of machines in multi-row with forward and backward flow of products is being considered. The proposed work is discussed about the effective way of laying parallel machines in multiple rows to satisfy the minimization of bi-objective namely flow distance of products and area of the layout. A simple heuristic is developed to evaluate the bi-objectives for the given sequence of machines placed on the constrained multiple rows. Further, a harmony search algorithm is utilized to identify the best sequence of machines to be arranged in multi-rows to simultaneously minimize the bi-objectives. The effectiveness of the proposed algorithm is tested on the problems associated with single row machine layout and the problems dealt by Vitayasak and Pongcharoen (Expert Syst Appl 98:129-152, 2018). The results ensured that the proposed algorithm was capable of providing the best solution to the multi-row parallel machine layout problem by significantly minimizing the bi-objectives simultaneously.

关键词： multi-row parallel machine layout problem multi-product environment Flow distance of products Area of the layout Simple heuristic Harmony search algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：