SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
From MaRDI portal
Recommendations
- Balancing assembly lines effectively -- a computational comparison
- A competitive branch-and-bound algorithm for the simple assembly line balancing problem
- An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
- Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure
Cited in
(55)- Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure
- \texttt{Absalom}: balancing assembly lines with assignment restrictions
- Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure
- Optimally balancing assembly lines with different workstations
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Assembly line balancing in a mixed-model sequencing environment with synchronous transfers.
- The robust (minmax regret) assembly line worker assignment and balancing problem
- Balancing assembly lines effectively -- a computational comparison
- An enumerative heuristic and reduction methods for the assembly line balancing problem
- U-shaped assembly line layouts and their impact on labor productivity: an experimental study
- The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics
- A Benders' decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem
- Approximation algorithms for simple assembly line balancing problems
- Assembly line balancing: what happened in the last fifteen years?
- Branch, bound and remember algorithm for two-sided assembly line balancing problem
- SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing
- Multiple-source learning precedence graph concept for the automotive industry
- Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry
- A branch-and-bound algorithm for assembly line worker assignment and balancing problems
- Optimally solving the alternative subgraphs assembly line balancing problem
- An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
- An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
- Assembly line balancing problems with multi-manned stations: a new mathematical formulation and Gantt based heuristic method
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- A survey on problems and methods in generalized assembly line balancing
- An linear programming based lower bound for the simple assembly line balancing problem
- Balancing assembly lines with tabu search
- Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
- Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements
- Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem
- Stochastic assembly line balancing: general bounds and reliability-based branch-and-bound algorithm
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- An improved mathematical program to solve the simple assembly line balancing problem
- Reconfiguration of assembly lines under the influence of high product variety in the automotive industry-a decision support system
- Balancing mixed-model assembly lines: a computational evaluation of objectives to smoothen workload
- An efficient branch and bound algorithm for assembly line balancing problems with parallel multi-manned workstations
- Balancing mixed-model assembly lines using adjacent cross-training in a demand variation environment
- Procedures for the time and space constrained assembly line balancing problem
- On a learning precedence graph concept for the automotive industry
- A competitive branch-and-bound algorithm for the simple assembly line balancing problem
- Analysis of the simple assembly line balancing problem complexity
- R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines
- Bi-criteria assembly line balancing by considering flexible operation times
- An exact constraint programming based procedure for the multi-manned assembly line balancing problem
- A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem
- Flight test scheduling: a generic model, lower bounds, and iterated local search
- New solution approaches for balancing assembly lines with setup times
- An efficient hybridization of ant colony optimization and genetic algorithm for an assembly line balancing problem of type II under zoning constraints
- Overcoming poor data quality: optimizing validation of precedence relation data
- Domain-independent dynamic programming
- Enhanced exact and heuristic methods for the type-I two-sided assembly line balancing problem
- A branch-and-bound based solution approach for the mixed-model assembly line-balancing problem for minimizing stations and task duplication costs
- A dynamic programming based heuristic for the assembly line balancing problem
- A branch-and-bound algorithm to minimize the line length of a two-sided assembly line
- The sequence-dependent assembly line balancing problem
This page was built for publication: SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376733)
