Optimally balancing assembly lines with different workstations

DOI10.1016/S0166-218X(01)00259-1zbMath0995.90082MaRDI QIDQ1348257

Gaia Nicosia, Andrea Pacifici, Dario Pacciarelli

Publication date: 15 May 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

computational complexity; dynamic programming; branch and bound; assembly line balancing

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

90C39: Dynamic programming

Related Items

Bi-criteria assembly line balancing by considering flexible operation times, On solving the assembly line worker assignment and balancing problem via beam search, Ant algorithms for a time and space constrained assembly line balancing problem, On the complexity of assembly line balancing problems, A classification of assembly line balancing problems, A versatile algorithm for assembly line balancing, Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled, A survey on problems and methods in generalized assembly line balancing, A genetic algorithm for robotic assembly line balancing, An MCDA-DEA approach for mixed-model assembly line balancing problem under uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• Assembly line balancing as generalized bin packing
• Finding optimal line balances with OptPack
• A decomposition theorem for partially ordered sets
• Assembly System Design: A Branch and Cut Approach
• Maximal Flow Through a Network
• An Integer Programming Procedure for Assembly System Design Problems
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• On Dynamic Programming Methods for Assembly Line Balancing
• Characteristics of optimal workload allocation for closed queueing networks
• Eureka: A Hybrid System for Assembly Line Balancing
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• Throughput for production lines with serial work stations and parallel service facilities
• SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
• Assembly-Line Balancing—Dynamic Programming with Precedence Constraints
• An Algorithm for the Line Balancing Problem