Assembly line balancing as generalized bin packing

Authors:
T. S. Wee;M. J. Magazine
Affiliations:
Faculty of Engineering, Department of Management Sciences, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada;Faculty of Engineering, Department of Management Sciences, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
Venue:
Operations Research Letters
Year:
1982

Citing 1
Cited 4

New algorithms in bin packing

New algorithms in bin packing

Sequential vector packing

Theoretical Computer Science
Reduction approaches for a generalized line balancing problem

Computers and Operations Research
An efficient hybrid genetic algorithm to solve assembly line balancing problem with sequence-dependent setup times

Computers and Industrial Engineering
Sequential vector packing

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bin packing heuristics are generalized and adapted to solve the assembly line balancing problem. Worst-case analysis is provided. The results are compared to those for a resource constrained scheduling problem considered by Garey, Graham, Johnson and Yao.