A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem

DOI10.1016/0305-0548(90)90040-EzbMath0689.90050OpenAlexW1998581758MaRDI QIDQ582208

Fred F. Easton

Publication date: 1990

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(90)90040-e

zbMATH Keywords

assembly line balancingoptimal upper bound

Mathematics Subject Classification ID

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

Related Items

An exact dynamic programming algorithm for the precedence-constrained class sequencing problem ⋮ A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times ⋮ A strong cutting plane algorithm for the robotic assembly line balancing problem ⋮ A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem ⋮ A Reach and Bound algorithm for acyclic dynamic-programming networks

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• A method and two algorithms on the theory of partitions
• An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
• A Dynamic Programming Approach to Stochastic Assembly Line Balancing
• On Dynamic Programming Methods for Assembly Line Balancing
• Branch-and-Bound Strategies for Dynamic Programming
• Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
• Assembly-Line Balancing—Dynamic Programming with Precedence Constraints