Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing

DOI10.1016/j.ejor.2012.12.029zbMath1332.90176OpenAlexW2006249330MaRDI QIDQ257213

Alena Otto, Armin Scholl, Christian Otto

Publication date: 15 March 2016

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.12.029

zbMATH Keywords

schedulingcomplexity measuresassembly line balancingbenchmark data setprecedence graphstructure analysis

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements ⋮ The stability radius of an optimal line balance with maximum efficiency for a simple assembly line ⋮ 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 ⋮ Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) ⋮ Procedures for the bin packing problem with precedence constraints ⋮ A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem ⋮ Model and heuristics for the assembly line worker integration and balancing problem ⋮ The multi-objective assembly line worker integration and balancing problem of type-2 ⋮ A memetic algorithm for the cost-oriented robotic assembly line balancing problem ⋮ Stochastic assembly line balancing: general bounds and reliability-based branch-and-bound algorithm ⋮ Analysis of the simple assembly line balancing problem complexity ⋮ Balancing U-type assembly lines with human-robot collaboration ⋮ R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines ⋮ Bin Packing Problem with Time Lags ⋮ Optimal workforce assignment to operations of a paced assembly line ⋮ Security-aware database migration planning ⋮ SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing ⋮ Combinatorial Benders cuts for assembly line balancing problems with setups ⋮ Traveling worker assembly line (re)balancing problem: model, reduction techniques, and real case studies ⋮ Exact and heuristic methods for solving the robotic assembly line balancing problem ⋮ Multiple-source learning precedence graph concept for the automotive industry ⋮ Benders' decomposition for the balancing of assembly lines with stochastic demand ⋮ A fast and effective heuristic for smoothing workloads on assembly lines: algorithm design and experimental analysis ⋮ A simheuristic approach for throughput maximization of asynchronous buffered stochastic mixed-model assembly lines ⋮ Rules-based heuristic approach for the U-shaped assembly line balancing problem ⋮ Estimating the Stability Radius of an Optimal Solution to the Simple Assembly Line Balancing Problem ⋮ Mixed-model assembly line balancing problem considering learning effect and uncertain demand ⋮ Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing ⋮ An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset

Uses Software

• DIMACS
• SALBPGen

Cites Work

• Unnamed Item
• Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
• On a learning precedence graph concept for the automotive industry
• The sequence-dependent assembly line balancing problem
• \texttt{Absalom}: balancing assembly lines with assignment restrictions
• On methods for generating random partial orders
• On the measurement of complexity in activity networks
• Interval estimation for a binomial proportion. (With comments and a rejoinder).
• Testing heuristics: We have it all wrong
• Optimally solving the alternative subgraphs assembly line balancing problem
• A classification of assembly line balancing problems
• Balancing and scheduling tasks in assembly lines with sequence-dependent setup times
• 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 optimal piecewise-linear program for the U-line balancing problem with stochastic task times
• A genetic algorithm for robotic assembly line balancing
• An improved mathematical program to solve the simple assembly line balancing problem
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• Eureka: A Hybrid System for Assembly Line Balancing
• A comparison of heuristic algorithms for cost-oriented assembly line balancing
• Measures of the restrictiveness of project networks
• Reporting computational experiments in mathematical programming
• ULINO: Optimally balancing U-shaped JIT assembly lines
• SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
• Algorithm for tool placement in an automatic tool change magazine
• A Multiple-rule Heuristic for Assembly Line Balancing
• An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems