R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines

DOI10.1016/j.ejor.2023.06.007MaRDI QIDQ6069213

Rico Walter, Armin Scholl, Philipp Schulze

Publication date: 14 November 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

schedulingcombinatorial optimizationassembly line balancingworkload smoothingbranch, bound, and remember

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
• Procedures for the bin packing problem with precedence constraints
• A heuristic-based genetic algorithm for workload smoothing in assembly lines
• Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure
• Workload smoothing in simple assembly line balancing
• Resource-constrained project scheduling: Notation, classification, models, and methods
• An enumerative heuristic and reduction methods for the assembly line balancing problem
• Assembly line balancing: what happened in the last fifteen years?
• An updated survey of variants and extensions of the resource-constrained project scheduling problem
• SALSA: combining branch-and-bound with dynamic programming to smoothen workloads 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 Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
• Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
• An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• The Linear Multiple Choice Knapsack Problem
• SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
• A Branch and Cut Approach for Workload Smoothing on Assembly Lines
• The Bin Packing Problem with Precedence Constraints

This page was built for publication: R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines