A shortest route formulation of simple U-type assembly line balancing problem
From MaRDI portal
Publication:2486834
DOI10.1016/J.APM.2004.10.003zbMATH Open1077.90022OpenAlexW1964785556MaRDI QIDQ2486834FDOQ2486834
Authors: Hadi Gökçen, Cevriye Gencer, Emel Kizilkaya, Kürşad Aǧpak
Publication date: 17 August 2005
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2004.10.003
Recommendations
Cites Work
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- ULINO: Optimally balancing U-shaped JIT assembly lines
- An Algorithm for the Line Balancing Problem
- The stochastic U-line balancing problem
- Note. Optimal balancing of U-shaped assembly lines
- The U-line Line Balancing Problem
- Balancing \(U\)-lines in a multiple \(U\)-line facility
- Shortest-route formulation of mixed-model assembly line balancing problem
- The mixed-model U-line balancing problem
- ANALYSIS AND OPTIMIZATION OF A U-SHAPED PRODUCTION LINE
- Bounds and approximations for cycle times of a \(U\)-shaped production line
Cited In (11)
- Simple and U-type assembly line balancing by using an ant colony based algorithm
- Balancing of parallel U-shaped assembly lines
- Balancing and sequencing of parallel mixed-model assembly lines
- New mathematical and constraint programming models for U-type assembly line balancing problems with assignment restrictions
- Rules-based heuristic approach for the U-shaped assembly line balancing problem
- A classification of assembly line balancing problems
- Two-sided assembly line balancing problem with parallel performance capacity
- A network model for parallel line balancing problem
- ULINO: Optimally balancing U-shaped JIT assembly lines
- Shortest-route formulation of mixed-model assembly line balancing problem
- On the complexity of assembly line balancing problems
This page was built for publication: A shortest route formulation of simple U-type assembly line balancing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486834)