Rebalancing the assembly lines: exact solution approaches

Ece Sanci, Meral Azizoglu

Research output: Contribution to journalArticlepeer-review

33 Citations (SciVal)


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
Issue number20
Early online date4 May 2017
Publication statusPublished - 2017


  • 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


Dive into the research topics of 'Rebalancing the assembly lines: exact solution approaches'. Together they form a unique fingerprint.

Cite this