A new multi-objective heuristic algorithm for solving the stochastic assembly line re-balancing problem

被引:111
作者
Gamberini, Rita [1 ]
Grassi, Andrea [1 ]
Rimini, Blanca [1 ]
机构
[1] Univ Modena, Dipartimento Sci & Metodi Ingn, Fac Ingn, I-42100 Reggio Emilia, Italy
关键词
assembly; ALBP; re-balancing; TOPSIS; heuristic; multi-objective;
D O I
10.1016/j.ijpe.2005.02.013
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper a new heuristic for solving the assembly line re-balancing problem is presented. The method is based on the integration of a multi-attribute decision-making procedure, named "Technique for Order Preference by Similarity to Ideal Solution" (TOPSIS), and the well-known Kottas and Lau heuristic approach. The proposed methodology does not focus on the balancing of a new line, rather it takes into account the more interesting current industrial aspect of rebalancing an existing line, when some changes in the input parameters (i.e. product characteristics and cycle time) occur. Hence, the algorithm deals with the assembly line balancing problem by considering the minimization of two performance criteria: (i) the unit labour and expected unit incompletion costs, and (ii) tasks re-assignment. Particularly, the latter objective addresses the problem of keeping a high degree of similarity between previous and new balancing, in order to avoid costs related to tasks movements: operators training, product quality assurance, equipment installation and moving. To assess the performance of the presented approach a comparison with the original Kottas and Lau methodology is carried out. The results demonstrate the capability of the proposed algorithm of dealing with the multi-objective nature of the re-balancing problem. Solutions with advantages both in workload re-assignment, implying beneficial effects on the costs factors affected by tasks movements, and in completion costs are obtained in almost half of all problems solved. In the other cases, trade-off balancings with low increases in completion costs are presented. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:226 / 243
页数:18
相关论文
共 40 条
[1]   Heuristic methods for cost-oriented assembly line balancing: A comparison on solution quality and computing time [J].
Amen, M .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2001, 69 (03) :255-264
[2]   Heuristic methods for cost-oriented assembly line balancing: A survey [J].
Amen, M .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2000, 68 (01) :1-14
[3]  
[Anonymous], INT J PROD RES
[4]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[5]   A SURVEY OF EXACT ALGORITHMS FOR THE SIMPLE ASSEMBLY LINE BALANCING PROBLEM [J].
BAYBARS, I .
MANAGEMENT SCIENCE, 1986, 32 (08) :909-932
[6]   An integrated multi-criteria decision analysis and inexact mixed integer linear programming approach for solid waste management [J].
Cheng, S ;
Chan, CW ;
Huang, GH .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2003, 16 (5-6) :543-554
[7]  
Conrad, 1954, I PRODUCTION ENG J, V33, P562
[8]   USING LEARNING-THEORY IN ASSEMBLY LINES FOR NEW PRODUCTS [J].
DAREL, EM ;
RUBINOVITZ, J .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1991, 25 (1-3) :103-109
[9]  
DUDLEY N, 1962, INT J PROD RES, V1, P60
[10]   A survey of the assembly line balancing procedures [J].
Erel, E ;
Sarin, SC .
PRODUCTION PLANNING & CONTROL, 1998, 9 (05) :414-434