U-OPT: An analysis of exact U-shaped line balancing procedures

DOI10.1080/0020754031000149176zbMath1069.90059OpenAlexW2015781091MaRDI QIDQ4823489

John R. Olson, Gerald R. Aase, Marc J. Schniederjans

Publication date: 28 October 2004

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020754031000149176

zbMATH Keywords

brach-and-boundU-shaped assembly line-balancing problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Operations research and management science (90B99)

Related Items (11)

Balancing and sequencing of parallel mixed-model assembly lines ⋮ A classification of assembly line balancing problems ⋮ A versatile algorithm for assembly line balancing ⋮ A decomposition based solution algorithm for U-type assembly line balancing with interval data ⋮ Worker allocation in lean U-shaped production lines ⋮ ASALBP: the alternative subgraphs assembly line balancing problem ⋮ The stochastic U-line balancing problem: a heuristic procedure ⋮ Balancing of manufacturing systems with complex configurations for delayed product differentiation ⋮ A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem ⋮ Meeting demand variation using flexible U-shaped assembly lines ⋮ On the MILP model for the U-shaped assembly line balancing problems

This page was built for publication: U-OPT: An analysis of exact U-shaped line balancing procedures