The robust (minmax regret) assembly line worker assignment and balancing problem

Research output: Contribution to journalArticlepeer-review

31 Scopus citations

Abstract

Line balancing aims to assign the assembly tasks to the stations that compose the assembly line. A recent body of literature has been devoted to heterogeneity in the assembly process introduced by different workers. In such an environment, task times depend on the worker performing the operation and the problem aims at assigning tasks and workers to stations in order to maximize the throughput of the line. In this work, we consider an interval data version of the assembly line worker assignment and balancing problem (ALWABP) in which it is assumed that lower and upper bounds for the task times are known, and the objective is to find an assignment of tasks and workers to the workstations such that the absolute maximum regret among all of the possible scenarios is minimized. The relationship with other interval data minmax regret (IDMR) problems is investigated, the inapplicability of previous approximation methods is studied, regret evaluation is considered, and exact and heuristic solution methods are proposed and analyzed. The results of the proposed methods are compared in a computational experiment, showing the applicability of the method and the theoretical results to solve the problem under study. Additionally, these results are not only applicable to the problem in hand, but also to a more general class of problems.

Original languageEnglish
Pages (from-to)27-40
Number of pages14
JournalComputers and Operations Research
Volume93
DOIs
StatePublished - May 2018
Externally publishedYes

Keywords

  • Line balancing
  • Minmax regret
  • Production
  • Robust optimization

Fingerprint

Dive into the research topics of 'The robust (minmax regret) assembly line worker assignment and balancing problem'. Together they form a unique fingerprint.

Cite this