Assembly-Line Balancing—Dynamic Programming with Precedence Constraints

DOI10.1287/opre.11.3.442zbMath0126.36201MaRDI QIDQ5331681

Richard M. Karp, Michael Held, R. Shareshian

Publication date: 1963

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.11.3.442

zbMATH Keywords

operations research

Related Items

Die Behandlung von Entscheidungsproblemen mit Hilfe des Dynamischen Programmierens, A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem, On the complexity of dynamic programming for sequencing problems with precedence constraints, A dynamic programming based heuristic for the assembly line balancing problem, A compact labelling scheme for series-parallel graphs, On the measurement of complexity in activity networks, Dynamic programming meets the principle of inclusion and exclusion, Computing shortest paths in networks derived from recurrence relations, Optimal partitions for shop floor control in semiconductor wafer fabrication, On estimating the number of order ideals in partial orders, with some applications, An optimal procedure for the single-model deterministic assembly line balancing problem, Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure, Optimally balancing assembly lines with different workstations, Extensions of the dynamic programming method in the deterministic and stochastic assembly-line balancing problems, State-of-the-art exact and heuristic solution procedures for simple assembly line balancing, A survey on problems and methods in generalized assembly line balancing, An integrated layout for group technology with in-process inventory costs, A multiple criteria decision making approach for the assembly line balancing problem, An efficient heuristic method for the simple assembly line balancing problem