Analysis of the simple assembly line balancing problem complexity
From MaRDI portal
Recommendations
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- A competitive branch-and-bound algorithm for the simple assembly line balancing problem
- Improving the resolution of the simple assembly line balancing problem type E
- On the complexity of assembly line balancing problems
- Balancing assembly lines effectively -- a computational comparison
Cites work
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- A classification of assembly line balancing problems
- A comparison of heuristic algorithms for cost-oriented assembly line balancing
- A dynamic programming based heuristic for the assembly line balancing problem
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- A survey on problems and methods in generalized assembly line balancing
- An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset
- An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time
- An enumerative heuristic and reduction methods for the assembly line balancing problem
- Approximation algorithms for simple assembly line balancing problems
- Assembly line balancing as generalized bin packing
- Assembly line balancing: what happened in the last fifteen years?
- Balancing assembly lines effectively -- a computational comparison
- Beam-ACO for simple assembly line balancing
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Bin packing and related problems: general arc-flow formulation with graph compression
- Bin Packing Problem with Time Lags
- Bounds for Assembly Line Balancing Heuristics
- Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem
- Enhanced multi-hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry
- Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Improved integer programming models for simple assembly line balancing and related problems
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
- On the complexity of assembly line balancing problems
- Optimal multi-way number partitioning
- Procedures for the bin packing problem with precedence constraints
- Procedures for the time and space constrained assembly line balancing problem
- SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
Cited in
(4)- An improved mathematical program to solve the simple assembly line balancing problem
- A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem
- Flight test scheduling: a generic model, lower bounds, and iterated local search
- New solution approaches for balancing assembly lines with setup times
This page was built for publication: Analysis of the simple assembly line balancing problem complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6047869)
