A Branch and Bound Algorithm for Assembly Line Balancing Problems with Formulation Irregularities
From MaRDI portal
Publication:3040914
DOI10.1287/mnsc.29.11.1309zbMath0526.90051MaRDI QIDQ3040914
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
branch and bound algorithm; assembly line balancing problems; between-task precedence relationships; deterministic performance times
65K05: Numerical mathematical programming methods
90C90: Applications of mathematical programming
90B35: Deterministic scheduling theory in operations research
90B30: Production models
Related Items
Balancing flexible lines for car components assembly, A weighted multiobjective optimization method for mixed-model assembly line problem, Formulation of workforce skill constraints in assembly line balancing models, Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure, \texttt{Absalom}: balancing assembly lines with assignment restrictions, The mixed and multi model line balancing problem: A comparison, Designing paced assembly lines with fixed number of stations, U-shaped assembly line layouts and their impact on labor productivity: an experimental study, A classification of assembly line balancing problems, A versatile algorithm for assembly line balancing, A survey on problems and methods in generalized assembly line balancing
