A New Algorithm for U-Shaped Two-Sided Assembly Line Balancing
Loading...

Date
2010
Journal Title
Journal ISSN
Volume Title
Publisher
Canadian Science Publishing
Open Access Color
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
Abstract
This study introduces a new hybrid design for a specific case-of assembly lines, and proposes a multi-pass random assignment algorithm to find the minimum number of stations required. The algorithm also finds the sequence and the schedule of the tasks assigned. The new design is a combination of two-sided lines and U-shaped lines, which benefits from the advantages of both designs at the same time. One side of the line is arranged in U-shape allowing stations with crossovers, and the other side of the line is balanced like a traditional straight flow. Depending on product direction, either Left or Right side of the line can be designed in U-shape. Small and large-sized two-sided assembly line test-bed problems were solved using the algorithm. Optimal results are achieved for all small-sized problems. Due to the novelty Of the design, results of large-sized problems are compared to findings of studies on simple two-sided balancing. Algorithm produced better results in most of the cases.
Description
Yavuz, Mustafa/0009-0001-9179-9107; Yegul, Mustafa Fatih/0000-0002-1457-3323; Agpak, Kursad/0000-0003-2430-0174
Keywords
Two-Sided Assembly Line, Assembly Line Balancing, U-Shaped Assembly Line, Comsoal, Multi-Pass Assignment Heuristic
Fields of Science
0209 industrial biotechnology, 0211 other engineering and technologies, 02 engineering and technology
Citation
Yegül, M.F., Agpak, K., Yavuz, M. (2010). A new algorithm for u-shaped two-sided assembly line balancing. Transaction of the Canadian Society For Mechanical Engineering, 34(2), 225-241.
WoS Q
Q4
Scopus Q
Q3

OpenCitations Citation Count
27
Source
Transactions of the Canadian Society for Mechanical Engineering
Volume
34
Issue
2
Start Page
225
End Page
241
PlumX Metrics
Citations
CrossRef : 26
Scopus : 28
Captures
Mendeley Readers : 29
Google Scholar™


