4.7 Article

A recursive operator allocation approach for assembly line-balancing optimization problem with the consideration of operator efficiency

期刊

COMPUTERS & INDUSTRIAL ENGINEERING
卷 51, 期 4, 页码 585-608

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2006.05.002

关键词

assembly line-balancing; combinatorial optimization; operator efficiency; recursive algorithm

向作者/读者索取更多资源

This paper addresses an optimization model for assembly line-balancing problem in order to improve the line balance of a production line under a human-centric and dynamic apparel assembly process. As the variance of operator efficiency is vital to line imbalance in labor intensive industry, an approach is proposed to balance production line through optimal operator allocation with the consideration of operator efficiency. Two recursive algorithms are developed to generate all feasible solutions for operator allocation. Three objectives, namely, the lowest standard deviation of operation efficiency, the highest production line efficiency and the least total operation efficiency waste, are devised to find out the optimal solution of operator allocation. The method in this paper improves the flexibility of the operator allocation on different sizes of data set of operations and operators, and enhances the efficiency of searching for the optimal solution of big size data set. The results of experiments are reported. The performance comparison demonstrates that the proposed optimization method outperforms the industry practice. (c) 2006 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据