Pages that link to "Item:Q2569059"
From MaRDI portal
The following pages link to State-of-the-art exact and heuristic solution procedures for simple assembly line balancing (Q2569059):
Displaying 21 items.
- U-shaped assembly line balancing problem with genetic algorithm (Q3533210) (← links)
- Metaheuristics based on Bin Packing for the line balancing problem (Q3598684) (← links)
- Hybrid evolutionary multi-objective algorithms for integrating assembly sequence planning and assembly line balancing (Q3605418) (← links)
- Bi criteria flexible assembly line design problem with equipment decisions (Q3605440) (← links)
- Evaluation of performance measures for representing operational objectives of a mixed model assembly line balancing problem (Q3605444) (← links)
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem (Q3737195) (← links)
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing (Q4376733) (← links)
- A Multiple-rule Heuristic for Assembly Line Balancing (Q4834088) (← links)
- Bin Packing Problem with Time Lags (Q5106420) (← links)
- Improved integer programming models for simple assembly line balancing and related problems (Q5374525) (← links)
- Design and operation of dynamic assembly lines using work-sharing (Q5385383) (← links)
- Integrating inspection-policy design in assembly-line balancing (Q5385386) (← links)
- Analysis of the simple assembly line balancing problem complexity (Q6047869) (← links)
- Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach (Q6048109) (← links)
- R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines (Q6069213) (← links)
- Exact and heuristic methods for a workload allocation problem with chain precedence constraints (Q6112777) (← links)
- A novel variable neighborhood strategy adaptive search for SALBP-2 problem with a limit on the number of machine's types (Q6170690) (← links)
- An exact constraint programming based procedure for the multi-manned assembly line balancing problem (Q6551052) (← links)
- A new upper bound based on Dantzig-Wolfe decomposition to maximize the stability radius of a simple assembly line under uncertainty (Q6555181) (← links)
- A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem (Q6568392) (← links)
- Evaluation of stochastic flow lines with provisioning of auxiliary material (Q6617065) (← links)
