An exact approach for the robust assembly line balancing problem

Jordi Pereira, Eduardo Álvarez-Miranda

Research output: Contribution to journalArticlepeer-review

43 Scopus citations

Abstract

This work studies an assembly line balancing problem with uncertainty on the task times. In order to deal with the uncertainty, a robust formulation to handle changes in the operation times is put forward. In order to solve the problem, several lower bounds, dominance rules and an enumeration procedure are proposed. These methods are tested in a computational experiment using different instances derived from the literature and then compared to similar previous approaches. The results of the experiment show that the method is able to solve larger instances in shorter running times. Furthermore, the cost of protecting a solution against uncertainty is also investigated. The results highlight that protecting an assembly line against moderate levels of uncertainty can be achieved at the expense of small quantities of additional resources (stations).

Original languageEnglish
Pages (from-to)85-98
Number of pages14
JournalOmega (United Kingdom)
Volume78
DOIs
StatePublished - Jul 2018
Externally publishedYes

Keywords

  • Branch-and-bound
  • Line balancing
  • Lower bounds
  • Robust optimization

Fingerprint

Dive into the research topics of 'An exact approach for the robust assembly line balancing problem'. Together they form a unique fingerprint.

Cite this