On Dynamic Programming Methods for Assembly Line Balancing

DOI10.1287/opre.30.2.375zbMath0481.90043OpenAlexW2168162186MaRDI QIDQ3939583

Edward P. C. Kao, Maurice Queyranne

Publication date: 1982

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

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

zbMATH Keywords

sequencingcomparison of algorithmsassembly line balancingrandomly generated test problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

A compact labelling scheme for series-parallel graphs, An algorithm to generate the ideals of a partial order, An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem, Dynamic programming and decomposition approaches for the single machine total tardiness problem, Optimally balancing assembly lines with different workstations, Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming, Exact and heuristic methods for a workload allocation problem with chain precedence constraints, Resource-constrained project scheduling: A survey of recent developments., On the complexity of dynamic programming for sequencing problems with precedence constraints, An evaluation of the adequacy of project network generators with systematically sampled networks, Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization, A random generator of resource-constrained multi-project network problems, 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, A survey of algorithms for the single machine total weighted tardiness scheduling problem, An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations, 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, On the complexity of a family of generalized matching problems