A branch, bound, and remember algorithm for the simple disassembly line balancing problem
type: Item
instance of: scholarly article
title: A branch, bound, and remember algorithm for the simple disassembly line balancing problem
zbMATH Open document ID: 1458.90235
author: Jinlin Li
author: Zhanguo Zhu
author: Caijun Yang
author: Chengbin Chu
author: Xiaohong Chen
published in: Computers \& Operations Research
publication date: 2019-02-19T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7024938
zbMATH Keywords: disassembly line balancing
zbMATH Keywords: lower bound
zbMATH Keywords: branch and bound
zbMATH Keywords: heuristic
MaRDI profile type: Publication
full work available at URL: j.cor.2019.01.003
OpenAlex ID: W2911039373
cites work: A sample average approximation method for disassembly line balancing problem under uncertainty
cites work: Second order conic approximation for disassembly line design with joint probabilistic constraints
cites work: Q3425131
cites work: New classes of fast lower bounds for bin packing problems
cites work: An enumerative heuristic and reduction methods for the assembly line balancing problem
cites work: Disassembly line in product recovery
cites work: A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem
cites work: A disassembly line balancing problem with fixed number of workstations
cites work: Generation of assembly graphs by systematic analysis of assembly structures
cites work: A branch, bound, and remember algorithm for the simple assembly line balancing problem
Wikidata QID: Q128606897
DOI: 10.1016/J.COR.2019.01.003
description: scientific article; zbMATH DE number 7024938