Pages that link to "Item:Q339701"
From MaRDI portal
The following pages link to An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations (Q339701):
Displaying 10 items.
- An enhanced branch-and-bound algorithm for the talent scheduling problem (Q322481) (← links)
- Model and heuristics for the assembly line worker integration and balancing problem (Q337340) (← links)
- Comprehensive review and evaluation of heuristics and meta-heuristics for two-sided assembly line balancing problem (Q1652325) (← links)
- Optimization on production-inventory problem with multistage and varying demand (Q1952905) (← 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)
- Multi-manned assembly line balancing problem with dependent task times: a heuristic based on solving a partition problem with constraints (Q2140318) (← links)
- Assembly line balancing problems with multi-manned stations: a new mathematical formulation and Gantt based heuristic method (Q2399325) (← links)
- Constraint programming model for multi-manned assembly line balancing problem (Q2664418) (← links)
- Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers (Q6099415) (← links)