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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of production research Ročník 55; číslo 20; s. 5991 - 6010
Hlavní autoři: Sanci, Ece, Azizoglu, Meral
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Taylor & Francis 18.10.2017
Taylor & Francis LLC
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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