Pages that link to "Item:Q336970"

The following pages link to A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem (Q336970):

Displaying 14 items.

• Model and heuristics for the assembly line worker integration and balancing problem (Q337340) (← links)
• The multi-objective assembly line worker integration and balancing problem of type-2 (Q1652274) (← links)
• The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575) (← links)
• A memetic algorithm for the cost-oriented robotic assembly line balancing problem (Q1654375) (← links)
• Optimal workforce assignment to operations of a paced assembly line (Q1694335) (← links)
• Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies (Q1751911) (← links)
• Exact and heuristic methods for solving the robotic assembly line balancing problem (Q1754736) (← links)
• Developing optimization \& robust models for a mixed-model assembly line balancing problem with semi-automated operations (Q1984875) (← links)
• Robotic disassembly line balancing problem: a mathematical model and ant colony optimization approach (Q2049765) (← links)
• Exact makespan minimization of unrelated parallel machines (Q2165594) (← links)
• Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: a multi-objective approach (Q2185520) (← links)
• A branch-and-bound algorithm for assembly line worker assignment and balancing problems (Q2257352) (← links)
• Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem (Q2668676) (← links)
• Exact and heuristic methods for a workload allocation problem with chain precedence constraints (Q6112777) (← links)