SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing
From MaRDI portal
Publication:2242373
DOI10.1016/j.ejor.2021.03.021zbMath1490.90113OpenAlexW3136444550MaRDI QIDQ2242373
Philipp Schulze, Rico Walter, Armin Scholl
Publication date: 9 November 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.03.021
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items (2)
Assembly line balancing: what happened in the last fifteen years? ⋮ R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines
Uses Software
Cites Work
- Unnamed Item
- Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
- The type E simple assembly line balancing problem: a mixed integer linear programming formulation
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- Lower bounds and reduction procedures for the bin packing problem
- The one-machine sequencing problem
- A heuristic-based genetic algorithm for workload smoothing in assembly lines
- Designing paced assembly lines with fixed number of stations
- A minimal algorithm for the multiple-choice knapsack problem
- Workload smoothing in simple assembly line balancing
- An enumerative heuristic and reduction methods for the assembly line balancing problem
- An analysis of lower bound procedures for the bin packing problem
- The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics
- Using the Taguchi method to optimize the differential evolution algorithm parameters for minimizing the workload smoothness index in simple assembly line balancing
- A fast and effective heuristic for smoothing workloads on assembly lines: algorithm design and experimental analysis
- A note on ``Workload smoothing in simple assembly line balancing
- A classification of assembly line balancing problems
- 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
- A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
- An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
- An O(n) algorithm for the multiple-choice knapsack linear program
- Multi-objective balancing of assembly lines by population heuristics
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- The Linear Multiple Choice Knapsack Problem
- Capacitated Vehicle Routing on Trees
- Technical Note—Assembly-Line Balancing: Zero-One Programming with Fibonacci Search
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
- A Branch and Cut Approach for Workload Smoothing on Assembly Lines
- Balancing and sequencing manual mixed-model assembly lines
This page was built for publication: SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing
