An enumerative heuristic and reduction methods for the assembly line balancing problem
type: Item
instance of: scholarly article
title: An enumerative heuristic and reduction methods for the assembly line balancing problem
zbMATH Open document ID: 1011.90039
DOI: 10.1016/S0377-2217(02)00204-7
author: Krzysztof Fleszar
author: Khalil S. Hindi
published in: European Journal of Operational Research
publication date: 2003-04-10T00:00:00Z
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1896798
zbMATH Keywords: heuristics
zbMATH Keywords: assembly line
zbMATH Keywords: balancing
zbMATH Keywords: problem reduction
MaRDI profile type: Publication
cites work: A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
cites work: Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
cites work: Eureka: A Hybrid System for Assembly Line Balancing
cites work: Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
cites work: Finding optimal line balances with OptPack
cites work: Balancing assembly lines effectively -- a computational comparison
cites work: SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
cites work: A competitive branch-and-bound algorithm for the simple assembly line balancing problem
full work available at URL: s0377-2217(02)00204-7
OpenAlex ID: W2031131994
description: scientific article; zbMATH DE number 1896798