Pages that link to "Item:Q582208"

The following pages link to A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem (Q582208):

Displaying 8 items.

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