Approximation algorithms for simple assembly line balancing problems

DOI10.1007/S10878-021-00778-2MaRDI QIDQ2125223zbMATH OpenOpenAlexFDO

Authors Santiago Valdés Ravelo

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

zbMATH Keywords

approximation algorithmcombinatorial optimizationNP-hardsimple assembly line balancing problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Applications of mathematical programming (90C90)

Recommendations

• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• Balancing of simple assembly lines under variations of task processing times
• Improving the resolution of the simple assembly line balancing problem type E
• Heuristic for balancing a simple assembly line (SALBP, type-1 problem)
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing

Cites work

• A decomposition based solution algorithm for U-type assembly line balancing with interval data
• A memetic algorithm for the cost-oriented robotic assembly line balancing problem
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• A survey on problems and methods in generalized assembly line balancing
• An Algorithm for the Line Balancing Problem
• Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
• Approximation schemes for scheduling on parallel machines
• Assembly line balancing as generalized bin packing
• Assembly-Line Balancing by Linear Programming
• Bounds for Assembly Line Balancing Heuristics
• Bounds for Certain Multiprocessing Anomalies
• Combinatorial optimization. Theory and applications.
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Introduction to algorithms.
• On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
• On the complexity of assembly line balancing problems
• Optimal multi-way number partitioning
• Partially ordered knapsack and applications to scheduling
• SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
• The stability radius of an optimal line balance with maximum efficiency for a simple assembly line

Cited in

(10)

• A two-process implicit enumeration algorithm for the simple assembly line balancing problem
• On the complexity of assembly line balancing problems
• Optimally solving the alternative subgraphs assembly line balancing problem
• A note on ``Workload smoothing in simple assembly line balancing
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
• Approximation Algorithms for the Assembly Line Crew Scheduling Problem
• scientific article; zbMATH DE number 4059101 (Why is no real title available?)
• On Assembly-Line Balancing Problems
• Analysis of the simple assembly line balancing problem complexity
• Solving type-I unpaced synchronous mixed-model two-sided assembly line balancing problem using a genetic algorithm

This page was built for publication: Approximation algorithms for simple assembly line balancing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2125223)