Pages that link to "Item:Q2003432"

The following pages link to On the complexity of assembly line balancing problems (Q2003432):

Displaying 15 items.

• Branch-and-bound algorithms for the multi-product assembly line balancing problem (Q1194733) (← links)
• NP-hardness proof for the assembly problem with stationary setup and additive holding costs (Q1949675) (← links)
• Approximation algorithms for simple assembly line balancing problems (Q2125223) (← links)
• Assembly line balancing: what happened in the last fifteen years? (Q2140264) (← links)
• Two-sided assembly lines balancing with assignment restrictions (Q2256379) (← links)
• Optimally solving the alternative subgraphs assembly line balancing problem (Q2267306) (← links)
• Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds (Q2569064) (← links)
• A survey of the parallel assembly lines balancing problem (Q2664411) (← links)
• Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning (Q2668752) (← links)
• Stronger upper and lower bounds for a hard batching problem to feed assembly lines (Q3503545) (← links)
• (Q3793924) (← links)
• (Q4396115) (← links)
• On Assembly-Line Balancing Problems (Q5568941) (← links)
• Analysis of the simple assembly line balancing problem complexity (Q6047869) (← links)
• Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time (Q6577341) (← links)