Rebalancing the assembly lines: exact solution approaches

In this study, we consider an assembly line rebalancing problem with disruptions caused by workstation breakdowns or shutdowns. After the disruption, we aim to find a rebalance so as to catch the trade-off between the efficiency measure of cycle time and stability measure of number of tasks assigned...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of production research Jg. 55; H. 20; S. 5991 - 6010
Hauptverfasser: Sanci, Ece, Azizoglu, Meral
Format: Journal Article
Sprache:Englisch
Veröffentlicht: London Taylor & Francis 18.10.2017
Taylor & Francis LLC
Schlagworte:
Algorithms
Assembly lines
Branch & bound algorithms
branch and bound algorithm
Cycle time
Disruption
Integer programming
Linear programming
Mixed integer
mixed integer linear programming
nondominated objective vectors
rebalancing
Shutdowns
Stability
Studies
Time measurement
Workstations
ISSN:0020-7543, 1366-588X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this study, we consider an assembly line rebalancing problem with disruptions caused by workstation breakdowns or shutdowns. After the disruption, we aim to find a rebalance so as to catch the trade-off between the efficiency measure of cycle time and stability measure of number of tasks assigned to different workstations in the original and new balances. Our aim is to generate all nondominated objective vectors with respect to the efficiency and stability measures. We develop two optimisation algorithms: a Mixed Integer Linear Programming-based algorithm and a Branch and Bound algorithm. The results of our experiments have shown the favourable performances of both algorithms and the superiority of the Branch and Bound algorithm.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0020-7543
1366-588X
DOI:10.1080/00207543.2017.1319583