A branch-and-bound based solution approach for the mixed-model assembly line-balancing problem for minimizing stations and task duplication costs

Yossi Bukchin*, Ithai Rabinowitch

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

113 Scopus citations

Abstract

A common assumption in the literature on mixed-model assembly line balancing is that a task that is common to multiple models must be assigned to a single station. In this paper, we relax this restriction, and allow a common task to be assigned to different stations for different models. We seek to minimize the sum of costs of the stations and the task duplication. We develop an optimal solution procedure based on a backtracking branch-and-bound algorithm and evaluate its performance via a large set of experiments. A branch-and-bound based heuristic is then developed for solving large-scale problems. The heuristic solutions are compared with a lower bound and experiments show that the heuristic provides much better solutions than those obtained by traditional approaches.

Original languageAmerican English
Pages (from-to)492-508
Number of pages17
JournalEuropean Journal of Operational Research
Volume174
Issue number1
DOIs
StatePublished - 1 Oct 2006
Externally publishedYes

Keywords

  • Branch-and-bound
  • Mixed-model assembly line balancing
  • Production

Fingerprint

Dive into the research topics of 'A branch-and-bound based solution approach for the mixed-model assembly line-balancing problem for minimizing stations and task duplication costs'. Together they form a unique fingerprint.

Cite this