Assembly-Line Balancing—Dynamic Programming with Precedence Constraints

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

Michael Held, R. Shareshian, Richard M. Karp

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 (22)

A compact labelling scheme for series-parallel graphs ⋮ An efficient heuristic method for the simple assembly line balancing problem ⋮ Assembly line balancing: what happened in the last fifteen years? ⋮ Optimally balancing assembly lines with different workstations ⋮ Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming ⋮ On the measurement of complexity in activity networks ⋮ Dynamic programming meets the principle of inclusion and exclusion ⋮ On the complexity of dynamic programming for sequencing problems with precedence constraints ⋮ Computing shortest paths in networks derived from recurrence relations ⋮ Optimal partitions for shop floor control in semiconductor wafer fabrication ⋮ A dynamic programming based heuristic for the assembly line balancing problem ⋮ An integrated layout for group technology with in-process inventory costs ⋮ On estimating the number of order ideals in partial orders, with some applications ⋮ A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem ⋮ A multiple criteria decision making approach for the assembly line balancing problem ⋮ An optimal procedure for the single-model deterministic assembly line balancing problem ⋮ Extensions of the dynamic programming method in the deterministic and stochastic assembly-line balancing problems ⋮ Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure ⋮ 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 ⋮ Die Behandlung von Entscheidungsproblemen mit Hilfe des Dynamischen Programmierens ⋮ An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time

This page was built for publication: Assembly-Line Balancing—Dynamic Programming with Precedence Constraints