Pages that link to "Item:Q2569064"
From MaRDI portal
The following pages link to Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds (Q2569064):
Displaying 16 items.
- Combining matheuristics and MILP to solve the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) (Q337057) (← links)
- The type E simple assembly line balancing problem: a mixed integer linear programming formulation (Q342081) (← links)
- Formulation of workforce skill constraints in assembly line balancing models (Q402239) (← links)
- Bi-criteria assembly line balancing by considering flexible operation times (Q651766) (← links)
- Using distributed search methods for balancing mixed-model assembly lines in the automotive industry (Q991823) (← links)
- Shortest-route formulation of mixed-model assembly line balancing problem (Q1610143) (← links)
- A memetic algorithm for the cost-oriented robotic assembly line balancing problem (Q1654375) (← links)
- On the complexity of assembly line balancing problems (Q2003432) (← links)
- A classification of assembly line balancing problems (Q2371356) (← links)
- An improved mathematical program to solve the simple assembly line balancing problem (Q3055448) (← links)
- A multiple single-pass heuristic algorithm solving the stochastic assembly line rebalancing problem (Q3055647) (← links)
- ASALBP: the alternative subgraphs assembly line balancing problem (Q3498913) (← links)
- Stronger upper and lower bounds for a hard batching problem to feed assembly lines (Q3503545) (← links)
- Improved integer programming models for simple assembly line balancing and related problems (Q5374525) (← links)
- Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach (Q6048109) (← links)
- Research trends in combinatorial optimization (Q6091419) (← links)
