Balancing assembly lines effectively -- a computational comparison
From MaRDI portal
Publication:1809823
Recommendations
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
- A competitive branch-and-bound algorithm for the simple assembly line balancing problem
- Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements
- Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
- Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure
Cites work
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- A two-process implicit enumeration algorithm for the simple assembly line balancing problem
- An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
- An optimal procedure for the single-model deterministic assembly line balancing problem
- Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
- Eureka: A Hybrid System for Assembly Line Balancing
- Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
- Finding optimal line balances with OptPack
- New Benchmark Results for the Resource-Constrained Project Scheduling Problem
- Note: Microcomputer Performance of OptPack on Hoffmann's Data Sets: Comparison with Eureka and FABLE
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
Cited in
(59)- 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
- Zero-cycles on Hilbert-Blumenthal surfaces
- Mixed model line balancing with parallel stations, zoning constraints, and ergonomics
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Modelling transfer line design problem via a set partitioning problem
- 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
- Balancing of simple assembly lines under variations of task processing times
- Constraint programming approaches to disassembly line balancing problem with sequencing decisions
- Branch, bound and remember algorithm for two-sided assembly line balancing problem
- Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry
- Optimally solving the alternative subgraphs assembly line balancing problem
- An evaluation of constructive heuristic methods for solving the alternative subgraphs assembly line balancing problem
- An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
- Assembly line balancing and group working: a heuristic procedure for workers' groups operating on the same product and workstation
- State-of-the-art exact and heuristic solution procedures for simple 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
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
- Balancing mixed-model assembly lines: a computational evaluation of objectives to smoothen workload
- A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem
- Balancing mixed-model assembly lines using adjacent cross-training in a demand variation environment
- Metaheuristics based on Bin Packing for the line balancing problem
- A weighted multiobjective optimization method for mixed-model assembly line problem
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
- A competitive branch-and-bound algorithm for the simple assembly line balancing problem
- Balancing and scheduling of flexible mixed model assembly lines
- Balancing stochastic type-II assembly lines: chance-constrained mixed integer and constraint programming models
- An alternative MILP model for makespan minimization on assembly lines
- A three-stage load balancing model in a manufacturing company
- Integrating inspection-policy design in assembly-line balancing
- Balancing large-scale machining lines with multi-spindle heads using decomposition
- Integrated planning for product module selection and assembly line design/reconfiguration
- On Assembly-Line Balancing Problems
- A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem
- Analysis of the simple assembly line balancing problem complexity
- Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach
- A scatter search based hyper-heuristic for sequencing a mixed-model assembly line
- Constraint programming approach for multi-objective two-sided assembly line balancing problem with multi-operator stations
- Straight assembly line balancing by workload smoothing: new results
- Bi-criteria assembly line balancing by considering flexible operation times
- Bi-objective minimization of energy consumption and cycle time for the robotic assembly line balancing problem: pseudo-polynomial case and reduced search space metaheuristic
- An efficient hybridization of ant colony optimization and genetic algorithm for an assembly line balancing problem of type II under zoning constraints
- A GRASP approach for the extended car sequencing problem
- Optimization of workcell layouts in a mixed-model assembly line environment
- Ant algorithms for a time and space constrained assembly line balancing problem
- Algorithms for the car sequencing and the level scheduling problem
- A branch-and-bound algorithm to minimize the line length of a two-sided assembly line
- A decomposition scheme for single stage scheduling problems
- Using distributed search methods for balancing mixed-model assembly lines in the automotive industry
- The sequence-dependent assembly line balancing problem
This page was built for publication: Balancing assembly lines effectively -- a computational comparison
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1809823)
