Assembly line balancing as generalized bin packing
Publication:1167660
DOI10.1016/0167-6377(82)90046-3zbMath0491.90049OpenAlexW2160785839MaRDI QIDQ1167660
T. S. Wee, Michael J. Magazine
Publication date: 1982
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(82)90046-3
heuristicsresource constrained schedulingbin packingcycle timetasksprecedence relationsassembly line balancing problemwork stationsworst case performance bounds
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Discrete mathematics in relation to computer science (68R99)
Related Items (47)
Cites Work
- Assembly line balancing as generalized bin packing
- Resource constrained scheduling as generalized bin packing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
- An Algorithm for the Line Balancing Problem
This page was built for publication: Assembly line balancing as generalized bin packing