A branch-and-bound algorithm to minimize the line length of a two-sided assembly line
type: Item
instance of: scholarly article
title: A branch-and-bound algorithm to minimize the line length of a two-sided assembly line
zbMATH Open document ID: 1188.90087
author: E. Wu
author: Jinsong Bao
author: Ye Jin
author: Xiao-Feng Hu
published in: European Journal of Operational Research
publication date: 2010-06-11T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5720441
zbMATH Keywords: manufacturing
zbMATH Keywords: branch-and-bound
zbMATH Keywords: assembly line balancing
zbMATH Keywords: two-sided assembly line
describes a project that uses: 2-ANTBAL
MaRDI profile type: Publication
full work available at URL: j.ejor.2010.02.034
OpenAlex ID: W2021295481
cites work: A survey on problems and methods in generalized assembly line balancing
cites work: An enumerative heuristic and reduction methods for the assembly line balancing problem
cites work: A station-oriented enumerative algorithm for two-sided assembly line balancing
cites work: Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure
cites work: Algorithm for tool placement in an automatic tool change magazine
cites work: Balancing assembly lines effectively -- a computational comparison
cites work: State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
cites work: Multiple-criteria decision-making in two-sided assembly line balancing: a goal programming and a fuzzy goal programming model
DOI: 10.1016/J.EJOR.2010.02.034
description: scientific article; zbMATH DE number 5720441