检索结果-南通市图书馆

Minimizing makespan of a production batch within concurrent systems:Seru production perspective

Journal of Management Science and Engineering 2022年第1期7卷 1-18页

作者： Yin Gai Yong Yin Jiafu Tang Shiqiang Liu College of Management Science and Engineering Dongbei University of Finance and EconomicsDalian116025China Graduate School of Business Doshisha UniversityKyoto602-8580Japan School of Economics and Management Fuzhou UniversityFuzhou350108China

This paper discusses the makespan minimization of a production batch within a specific concurrent system,seru production system.A seru production system consists of multiple independent serus.A seru is a compact assembly origination in which products are assembled from-the-beginning-to-the-end without *** capability of a seru production system is its responsiveness.A performance measure used to evaluate a seru system’s responsiveness is the makespan of production batches assembled within the seru *** study addresses the makespan minimization problem through an optimal seru loading *** problem is formulated as a min-max integer optimization *** exact dimension-reduction Algorithm is developed to obtain the optimal allocation that minimizes the *** show that the solution space increases very *** contrast,our algorithm is efficient with a polynomial computational complexity of,where is the total number of serus in a seru *** verify the usefulness of the developed exact dimension-reduction algorithm,we compare it with a widely practiced greedy algorithm through *** find that our optimal algorithm is robust in most cases and the greedy algorithm is efficient when variability in production efficiencies is *** result can guide us to adopt different algorithms in different business *** the variability in production efficiencies is high,e.g.,new employees and/or new products assembly,the greedy algorithm is *** other cases,our optimal algorithm should be adopted to obtain the minimum *** also extend the method to the application of a rotating seru.

关键词： Assembly Greedy algorithm Dimension reduction Exact algorithm Variability polynomial computational complexity

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：