An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations
From MaRDI portal
Publication:339701
DOI10.1016/j.cor.2012.04.019zbMath1349.90845OpenAlexW2015486272MaRDI QIDQ339701
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.04.019
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (10)
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 ⋮ Model and heuristics for the assembly line worker integration and balancing problem ⋮ Comprehensive review and evaluation of heuristics and meta-heuristics for two-sided assembly line balancing problem ⋮ Assembly line balancing problems with multi-manned stations: a new mathematical formulation and Gantt based heuristic method ⋮ Constraint programming model for multi-manned assembly line balancing problem ⋮ Benders' decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers ⋮ Optimization on production-inventory problem with multistage and varying demand ⋮ A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
Uses Software
Cites Work
- A branch-and-bound based solution approach for the mixed-model assembly line-balancing problem for minimizing stations and task duplication costs
- A network model for parallel line balancing problem
- A mathematical model and a genetic algorithm for two-sided assembly line balancing
- A branch-and-bound algorithm to minimize the line length of a two-sided assembly line
- Multiple-criteria decision-making in two-sided assembly line balancing: a goal programming and a fuzzy goal programming model
- Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure
- Finding optimal line balances with OptPack
- Multi-objective design of team oriented assembly systems.
- Balancing stochastic two-sided assembly lines: a chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm
- A station-oriented enumerative algorithm for two-sided assembly line balancing
- Assembly line balancing and group working: a heuristic procedure for workers' groups operating on the same product and workstation
- Balancing two-sided assembly lines with sequence-dependent setup times
- Balancing and sequencing of parallel mixed-model assembly lines
- Balancing parallel two-sided assembly lines
- Balancing parallel assembly lines with precise and fuzzy goals
- Formulation of a problem involving assembly lines with multiple manning of work stations
- Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
- A parallel station heuristic for the mixed-model production line balancing problem
- ULINO: Optimally balancing U-shaped JIT assembly lines
- Using simulated annealing to solve a multiobjective assembly line balancing problem with parallel workstations
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
- Scheduling duplicate serial stations in transfer lines
- Balancing assembly lines: an industrial case study
- 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
This page was built for publication: An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations
