A Branch and Bound Algorithm for Assembly Line Balancing Problems with Formulation Irregularities

DOI10.1287/mnsc.29.11.1309zbMath0526.90051OpenAlexW2070293822MaRDI QIDQ3040914

Roger V. Johnson

Publication date: 1983

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.29.11.1309

zbMATH Keywords

branch and bound algorithmassembly line balancing problemsbetween-task precedence relationshipsdeterministic performance times

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items

U-shaped assembly line layouts and their impact on labor productivity: an experimental study ⋮ A classification of assembly line balancing problems ⋮ Assembly line balancing: what happened in the last fifteen years? ⋮ A versatile algorithm for assembly line balancing ⋮ A weighted multiobjective optimization method for mixed-model assembly line problem ⋮ Formulation of workforce skill constraints in assembly line balancing models ⋮ Balancing flexible lines for car components assembly ⋮ The mixed and multi model line balancing problem: A comparison ⋮ Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure ⋮ Designing paced assembly lines with fixed number of stations ⋮ \texttt{Absalom}: balancing assembly lines with assignment restrictions ⋮ A survey on problems and methods in generalized assembly line balancing

This page was built for publication: A Branch and Bound Algorithm for Assembly Line Balancing Problems with Formulation Irregularities