Analysis of the simple assembly line balancing problem complexity
From MaRDI portal
Publication:6047869
DOI10.1016/j.cor.2023.106323MaRDI QIDQ6047869
Jordi Pereira, Mariona Vilà, Eduardo Álvarez-Miranda
Publication date: 13 September 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
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
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Bin packing and related problems: general arc-flow formulation with graph compression
- Procedures for the time and space constrained assembly line balancing problem
- A dynamic programming based heuristic for the assembly line balancing problem
- Assembly line balancing as generalized bin packing
- Balancing assembly lines effectively -- a computational comparison
- An enumerative heuristic and reduction methods for the assembly line balancing problem
- On the complexity of assembly line balancing problems
- Approximation algorithms for simple assembly line balancing problems
- Assembly line balancing: what happened in the last fifteen years?
- Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry
- 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
- 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
- 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
- Beam-ACO for Simple Assembly Line Balancing
- Bounds for Assembly Line Balancing Heuristics
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- A comparison of heuristic algorithms for cost-oriented assembly line balancing
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
- Optimal Multi-Way Number Partitioning
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
- Bin Packing Problem with Time Lags
- Improved integer programming models for simple assembly line balancing and related problems
This page was built for publication: Analysis of the simple assembly line balancing problem complexity