Optimally balancing assembly lines with different workstations
From MaRDI portal
Publication:1348257
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)
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items
A classification of assembly line balancing problems ⋮ A versatile algorithm for assembly line balancing ⋮ Ant algorithms for a time and space constrained assembly line balancing problem ⋮ Bi-criteria assembly line balancing by considering flexible operation times ⋮ An MCDA-DEA approach for mixed-model assembly line balancing problem under uncertainty ⋮ Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled ⋮ On the complexity of assembly line balancing problems ⋮ On solving the assembly line worker assignment and balancing problem via beam search ⋮ A survey on problems and methods in generalized assembly line balancing ⋮ A genetic algorithm for robotic assembly line balancing
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