An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations
From MaRDI portal
(Redirected from Publication:339701)
Recommendations
- Branch-and-bound algorithms for the multi-product assembly line balancing problem
- Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure
- Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure
- Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
- A competitive branch-and-bound algorithm for the simple assembly line balancing problem
Cites work
- A branch-and-bound algorithm to minimize the line length of a two-sided assembly line
- A branch-and-bound based solution approach for the mixed-model assembly line-balancing problem for minimizing stations and task duplication costs
- A mathematical model and a genetic algorithm for two-sided assembly line balancing
- A network model for parallel line balancing problem
- A parallel station heuristic for the mixed-model production line balancing problem
- A station-oriented enumerative algorithm for two-sided assembly line balancing
- A two-stage heuristic method for balancing mixed-model assembly lines with parallel workstations
- ANTBAL: an ant colony optimization algorithm for balancing mixed-model assembly lines with parallel workstations
- Assembly line balancing and group working: a heuristic procedure for workers' groups operating on the same product and workstation
- Balancing and sequencing of parallel mixed-model assembly lines
- Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure
- Balancing assembly lines: an industrial case study
- Balancing parallel assembly lines with precise and fuzzy goals
- Balancing parallel two-sided assembly lines
- Balancing stochastic two-sided assembly lines: a chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm
- Balancing two-sided assembly lines with sequence-dependent setup times
- Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
- Finding optimal line balances with OptPack
- Formulation of a problem involving assembly lines with multiple manning of work stations
- Multi-objective design of team oriented assembly systems.
- Multiple-criteria decision-making in two-sided assembly line balancing: a goal programming and a fuzzy goal programming model
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
- Scheduling duplicate serial stations in transfer lines
- ULINO: Optimally balancing U-shaped JIT assembly lines
- Using simulated annealing to solve a multiobjective assembly line balancing problem with parallel workstations
Cited in
(17)- Assembly line balancing problems with multi-manned stations: a new mathematical formulation and Gantt based heuristic method
- Optimization on production-inventory problem with multistage and varying demand
- Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
- Comprehensive review and evaluation of heuristics and meta-heuristics for two-sided assembly line balancing problem
- Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure
- Assembly line balancing: what happened in the last fifteen years?
- Multi-manned assembly line balancing problem with dependent task times: a heuristic based on solving a partition problem with constraints
- An enhanced branch-and-bound algorithm for the talent scheduling problem
- A Branch and Cut Approach for Workload Smoothing on Assembly Lines
- A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem
- Model and heuristics for the assembly line worker integration and balancing problem
- Constraint programming model for multi-manned assembly line balancing problem
- A matheuristic approach for the multi-manned assembly line balancing problem with collaborative robots
- Branch-and-bound algorithms for the multi-product assembly line balancing problem
- Heuristic and metaheuristic procedures for the buffer sizing problem in parallel assembly lines balancing problem with multi-line workstations and different cycle times
- An exact constraint programming based procedure for the multi-manned assembly line balancing problem
This page was built for publication: An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339701)
