Rebalancing the assembly lines: exact solution approaches

Ece Sanci, Meral Azizoglu

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

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.
Original languageEnglish
Pages (from-to)5991-6010
Number of pages20
JournalInternational Journal of Production Research
Volume55
Issue number20
Early online date4 May 2017
DOIs
Publication statusPublished - 2017

Keywords

  • assembly lines
  • branch and bound algorithm
  • mixed integer linear programming
  • nondominated objective vectors
  • rebalancing

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this

Rebalancing the assembly lines: exact solution approaches. / Sanci, Ece; Azizoglu, Meral.

In: International Journal of Production Research, Vol. 55, No. 20, 2017, p. 5991-6010.

Research output: Contribution to journalArticle

@article{da344baf6a824e80aa131cf6bdd7a493,
title = "Rebalancing the assembly lines: exact solution approaches",
abstract = "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.",
keywords = "assembly lines, branch and bound algorithm, mixed integer linear programming, nondominated objective vectors, rebalancing",
author = "Ece Sanci and Meral Azizoglu",
year = "2017",
doi = "10.1080/00207543.2017.1319583",
language = "English",
volume = "55",
pages = "5991--6010",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Taylor and Francis",
number = "20",

}

TY - JOUR

T1 - Rebalancing the assembly lines: exact solution approaches

AU - Sanci, Ece

AU - Azizoglu, Meral

PY - 2017

Y1 - 2017

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

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

KW - assembly lines

KW - branch and bound algorithm

KW - mixed integer linear programming

KW - nondominated objective vectors

KW - rebalancing

UR - http://www.scopus.com/inward/record.url?scp=85018337654&partnerID=8YFLogxK

U2 - 10.1080/00207543.2017.1319583

DO - 10.1080/00207543.2017.1319583

M3 - Article

VL - 55

SP - 5991

EP - 6010

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 20

ER -