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

DOI10.1016/0305-0548(90)90040-EMaRDI QIDQ582208zbMATH OpenOpenAlexFDO

Authors 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) Production models (90B30) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• A dynamic programming based heuristic for the assembly line balancing problem
• Extensions of the dynamic programming method in the deterministic and stochastic assembly-line balancing problems
• A Dynamic Programming Approach to Stochastic Assembly Line Balancing
• Balancing assembly lines effectively -- a computational comparison
• Procedures for the time and space constrained assembly line balancing problem

Cites work

• A Dynamic Programming Approach to Stochastic Assembly Line Balancing
• A method and two algorithms on the theory of partitions
• A note on two problems in connexion with graphs
• An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
• Assembly-Line Balancing—Dynamic Programming with Precedence Constraints
• Branch-and-Bound Strategies for Dynamic Programming
• Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
• scientific article; zbMATH DE number 3648418 (Why is no real title available?)
• On Dynamic Programming Methods for Assembly Line Balancing

Cited in

(8)

• Extensions of the dynamic programming method in the deterministic and stochastic assembly-line balancing problems
• A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
• An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
• A branch, bound, and remember algorithm for the simple assembly line balancing problem
• Stronger upper and lower bounds for a hard batching problem to feed assembly lines
• A Reach and Bound algorithm for acyclic dynamic-programming networks
• A Dynamic Programming Approach to Stochastic Assembly Line Balancing
• A strong cutting plane algorithm for the robotic assembly line balancing problem

This page was built for publication: A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem

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