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 Laumethodology is carried out. The results demonstrate the capability of the proposed algorithm of dealing with the multiobjective 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.
A NEW MULTI-OBJECTIVE HEURISTIC ALGORITHM FOR SOLVING THE STOCHASTIC ASSEMBLY LINE RE-BALANCING PROBLEM / Gamberini, Rita; Grassi, Andrea; Rimini, Bianca. - In: INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS. - ISSN 0925-5273. - ELETTRONICO. - 102:2(2006), pp. 226-243. [10.1016/j.ijpe.2005.02.013]
A NEW MULTI-OBJECTIVE HEURISTIC ALGORITHM FOR SOLVING THE STOCHASTIC ASSEMBLY LINE RE-BALANCING PROBLEM
GAMBERINI, Rita;GRASSI, Andrea;RIMINI, Bianca
2006
Abstract
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 Laumethodology is carried out. The results demonstrate the capability of the proposed algorithm of dealing with the multiobjective 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.File | Dimensione | Formato | |
---|---|---|---|
A new multi-objective heuristic algorithm for solving the stocastic assembly line re-balancing problem.pdf
Accesso riservato
Tipologia:
Versione dell'autore revisionata e accettata per la pubblicazione
Dimensione
272.27 kB
Formato
Adobe PDF
|
272.27 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris