Pages that link to "Item:Q1751911"
From MaRDI portal
The following pages link to Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies (Q1751911):
Displaying 16 items.
- Model and heuristics for the assembly line worker integration and balancing problem (Q337340) (← links)
- Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure (Q1042153) (← links)
- The multi-objective assembly line worker integration and balancing problem of type-2 (Q1652274) (← links)
- Comprehensive review and evaluation of heuristics and meta-heuristics for two-sided assembly line balancing problem (Q1652325) (← links)
- The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575) (← links)
- Balancing a robotic spot welding manufacturing line: an industrial case study (Q1694852) (← links)
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem (Q1999621) (← links)
- Assembly line balancing: what happened in the last fifteen years? (Q2140264) (← links)
- Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled (Q2473034) (← links)
- Dynamic task assignment for throughput maximization with worksharing (Q2569071) (← links)
- Tabu search algorithms for an industrial multi-product and multi-objective assembly line balancing problem, with reduction of the task dispersion (Q4656756) (← links)
- In-line kitting for part feeding of assembly lines: workload balancing and storage assignment to reduce the workers' walking effort (Q6049391) (← links)
- New mathematical and constraint programming models for U-type assembly line balancing problems with assignment restrictions (Q6094522) (← links)
- Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers (Q6099415) (← links)
- An exact constraint programming based procedure for the multi-manned assembly line balancing problem (Q6551052) (← links)
- A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem (Q6568392) (← links)
