Chance-constrained stochastic assembly line balancing with branch, bound and remember algorithm
From MaRDI portal
Publication:6547003
Recommendations
- Balancing stochastic type-II assembly lines: chance-constrained mixed integer and constraint programming models
- Stochastic assembly line balancing: general bounds and reliability-based branch-and-bound algorithm
- Branch, bound and remember algorithm for two-sided assembly line balancing problem
- Balancing stochastic two-sided assembly lines: a chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm
- Balancing stochastic parallel assembly lines
Cites work
- A branch-and-bound algorithm for assembly line worker assignment and balancing problems
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- A chance-constrained approach to stochastic line balancing problem
- A decomposition based solution algorithm for U-type assembly line balancing with interval data
- A Dynamic Programming Approach to Stochastic Assembly Line Balancing
- A multiple single-pass heuristic algorithm solving the stochastic assembly line rebalancing problem
- A novel variable neighborhood strategy adaptive search for SALBP-2 problem with a limit on the number of machine's types
- An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
- An optimal piecewise-linear program for the U-line balancing problem with stochastic task times
- Assembly line balancing: what happened in the last fifteen years?
- Balancing of simple assembly lines under variations of task processing times
- Balancing stochastic parallel assembly lines
- Balancing stochastic two-sided assembly line with multiple constraints using hybrid teaching-learning-based optimization algorithm
- Balancing stochastic two-sided assembly lines: a chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm
- Balancing stochastic type-II assembly lines: chance-constrained mixed integer and constraint programming models
- Benders' decomposition for the balancing of assembly lines with stochastic demand
- Branch, bound and remember algorithm for two-sided assembly line balancing problem
- Exact and heuristic methods for solving the robotic assembly line balancing problem
- Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements
- Mixed-model assembly line balancing problem considering learning effect and uncertain demand
- Modeling and analysis of a mixed‐model assembly line with stochastic operation times
- New classes of fast lower bounds for bin packing problems
- Stability factor for robust balancing of simple assembly lines under uncertainty
- Stability measure for a generalized assembly line balancing problem
- Stochastic assembly line balancing using beam search
- Stochastic assembly line balancing using simulated annealing
- Stochastic assembly line balancing: general bounds and reliability-based branch-and-bound algorithm
- Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
- The -cost minimization model for capacitated facility location-allocation problem with uncertain demands
- The robust (minmax regret) assembly line worker assignment and balancing problem
- The stability radius of an optimal line balance with maximum efficiency for a simple assembly line
- The stochastic U-line balancing problem: a heuristic procedure
- Theory and practice of uncertain programming.
- Uncertainty theory
Cited in
(2)
This page was built for publication: Chance-constrained stochastic assembly line balancing with branch, bound and remember algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547003)
