Approximation algorithms for simple assembly line balancing problems
From MaRDI portal
Publication:2125223
DOI10.1007/s10878-021-00778-2zbMath1490.90254OpenAlexW3186198161MaRDI QIDQ2125223
Publication date: 13 April 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00778-2
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A decomposition based solution algorithm for U-type assembly line balancing with interval data
- Partially ordered knapsack and applications to scheduling
- Assembly line balancing as generalized bin packing
- Approximation schemes for scheduling on parallel machines
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- The stability radius of an optimal line balance with maximum efficiency for a simple assembly line
- A memetic algorithm for the cost-oriented robotic assembly line balancing problem
- On the complexity of assembly line balancing problems
- A survey on problems and methods in generalized assembly line balancing
- Combinatorial optimization. Theory and applications.
- Assembly-Line Balancing by Linear Programming
- Bounds for Assembly Line Balancing Heuristics
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- 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
- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
- An Algorithm for the Line Balancing Problem
- Bounds for Certain Multiprocessing Anomalies
This page was built for publication: Approximation algorithms for simple assembly line balancing problems
