Assembly line rebalancing is a problem companies are frequently confronted with as continuous changes in product features and volume demand caused by the volatility of modern markets result in re-definition of assembly tasks and line cycle time fluctuations. Consequently, managers are forced to adjust the balancing of their lines in order to adapt to the new conditions while trying to minimise both increases in completion costs and costs related to changes in task assignment. In particular, when modifications are made to line balancing, costs are incurred for operator training, equipment switching and moving, and quality assurance. The stochastic assembly line rebalancing problem is essentially composed of a multi-objective problem in which two joint objectives, total expected completion cost of the new line and similarity between the new and the existing line, must be optimised. Consequently, this paper presents a multiple single-pass heuristic algorithm developed for the purpose of finding the most complete set of dominant solutions representing the Pareto front of the problem. The operative parameters of the heuristic are set as a result of a great deal of experimentation. Moreover, a multi-objective genetic algorithm is developed and then compared with the proposed heuristic in order to demonstrate its effectiveness. Finally, an illustrative case study is presented.

A multiple single-pass heuristic algorithm solving the stochastic assembly line rebalancing problem / Gamberini, Rita; Gebennini, Elisa; Grassi, Andrea; Regattieri, A.. - In: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH. - ISSN 0020-7543. - STAMPA. - 47:8(2009), pp. 2141-2164. [10.1080/00207540802176046]

A multiple single-pass heuristic algorithm solving the stochastic assembly line rebalancing problem

GAMBERINI, Rita;GEBENNINI, Elisa;GRASSI, Andrea;
2009

Abstract

Assembly line rebalancing is a problem companies are frequently confronted with as continuous changes in product features and volume demand caused by the volatility of modern markets result in re-definition of assembly tasks and line cycle time fluctuations. Consequently, managers are forced to adjust the balancing of their lines in order to adapt to the new conditions while trying to minimise both increases in completion costs and costs related to changes in task assignment. In particular, when modifications are made to line balancing, costs are incurred for operator training, equipment switching and moving, and quality assurance. The stochastic assembly line rebalancing problem is essentially composed of a multi-objective problem in which two joint objectives, total expected completion cost of the new line and similarity between the new and the existing line, must be optimised. Consequently, this paper presents a multiple single-pass heuristic algorithm developed for the purpose of finding the most complete set of dominant solutions representing the Pareto front of the problem. The operative parameters of the heuristic are set as a result of a great deal of experimentation. Moreover, a multi-objective genetic algorithm is developed and then compared with the proposed heuristic in order to demonstrate its effectiveness. Finally, an illustrative case study is presented.
47
8
2141
2164
A multiple single-pass heuristic algorithm solving the stochastic assembly line rebalancing problem / Gamberini, Rita; Gebennini, Elisa; Grassi, Andrea; Regattieri, A.. - In: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH. - ISSN 0020-7543. - STAMPA. - 47:8(2009), pp. 2141-2164. [10.1080/00207540802176046]
Gamberini, Rita; Gebennini, Elisa; Grassi, Andrea; Regattieri, A.
File in questo prodotto:
File Dimensione Formato  
A multiple single-pass heuristic algorithm solving the stochastic assembly.pdf

non disponibili

Tipologia: Post-print dell'autore (bozza post referaggio)
Dimensione 633.67 kB
Formato Adobe PDF
633.67 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

Licenza Creative Commons
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

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11380/421247
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 65
  • ???jsp.display-item.citation.isi??? 48
social impact