On Dynamic Programming Methods for Assembly Line Balancing

DOI10.1287/OPRE.30.2.375MaRDI QIDQ3939583zbMATH OpenOpenAlexFDO

Authors 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

assembly line balancingcomparison of algorithmsrandomly generated test problemssequencing

Mathematics Subject Classification ID

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

Cited in

(21)

• On the complexity of a family of generalized matching problems
• A compact labelling scheme for series-parallel graphs
• An algorithm to generate the ideals of a partial order
• Dynamic programming and decomposition approaches for the single machine total tardiness 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
• Optimally balancing assembly lines with different workstations
• Resource-constrained project scheduling: A survey of recent developments.
• Extensions of the dynamic programming method in the deterministic and stochastic assembly-line balancing problems
• Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
• Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming
• An evaluation of the adequacy of project network generators with systematically sampled networks
• 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 automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem
• A multiple criteria decision making approach for the assembly line balancing problem
• A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem
• Exact and heuristic methods for a workload allocation problem with chain precedence constraints
• On the summary measures for the resource-constrained project scheduling problem
• On the complexity of dynamic programming for sequencing problems with precedence constraints
• A random generator of resource-constrained multi-project network problems

This page was built for publication: On Dynamic Programming Methods for Assembly Line Balancing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3939583)