Bilgilendirme: Sürüm Güncellemesi ve versiyon yükseltmesi nedeniyle, geçici süreyle zaman zaman kesintiler yaşanabilir ve veri içeriğinde değişkenlikler gözlemlenebilir. Göstereceğiniz anlayış için teşekkür ederiz.
 

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

dc.contributor.author Agpak, Kursad
dc.contributor.author Yavuz, Mustafa
dc.contributor.author Yegul, Mustafa Fatih
dc.contributor.other 06.07. Malzeme Bilimi ve Mühendisliği
dc.contributor.other 06. Mühendislik Fakültesi
dc.contributor.other 01. Çankaya Üniversitesi
dc.date.accessioned 2016-06-08T09:20:55Z
dc.date.accessioned 2025-09-18T16:06:44Z
dc.date.available 2016-06-08T09:20:55Z
dc.date.available 2025-09-18T16:06:44Z
dc.date.issued 2010
dc.description Yavuz, Mustafa/0009-0001-9179-9107; Yegul, Mustafa Fatih/0000-0002-1457-3323; Agpak, Kursad/0000-0003-2430-0174 en_US
dc.description.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. en_US
dc.identifier.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. en_US
dc.identifier.doi 10.1139/tcsme-2010-0014
dc.identifier.issn 0315-8977
dc.identifier.issn 2816-5691
dc.identifier.scopus 2-s2.0-78349260083
dc.identifier.uri https://doi.org/10.1139/tcsme-2010-0014
dc.identifier.uri https://hdl.handle.net/20.500.12416/14565
dc.language.iso en en_US
dc.publisher Canadian Science Publishing en_US
dc.rights info:eu-repo/semantics/closedAccess en_US
dc.subject Two-Sided Assembly Line en_US
dc.subject Assembly Line Balancing en_US
dc.subject U-Shaped Assembly Line en_US
dc.subject Comsoal en_US
dc.subject Multi-Pass Assignment Heuristic en_US
dc.title A New Algorithm for U-Shaped Two-Sided Assembly Line Balancing en_US
dc.title A new algorithm for u-shaped two-sided assembly line balancing tr_TR
dc.type Article en_US
dspace.entity.type Publication
gdc.author.id Yavuz, Mustafa/0009-0001-9179-9107
gdc.author.id Yegul, Mustafa Fatih/0000-0002-1457-3323
gdc.author.id Agpak, Kursad/0000-0003-2430-0174
gdc.author.institutional Yavuz, Mustafa
gdc.author.scopusid 24923986300
gdc.author.scopusid 8084830100
gdc.author.scopusid 56379755000
gdc.author.wosid Ağpak, Kürşad/F-8985-2010
gdc.author.wosid Yavuz, Melek/Hjg-9929-2022
gdc.author.wosid Yegul, Mustafa Fatih/J-5490-2014
gdc.description.department Çankaya University en_US
gdc.description.departmenttemp [Yegul, Mustafa Fatih; Yavuz, Mustafa] Univ Waterloo, Dept Mech & Mechatron Engn, Waterloo, ON N2L 3G1, Canada; [Agpak, Kursad] Gaziantep Univ, Dept Ind Engn, Gaziantep, Turkey; [Yavuz, Mustafa] Cankaya Univ, Dept Ind Engn, Ankara, Turkey en_US
gdc.description.endpage 241 en_US
gdc.description.issue 2 en_US
gdc.description.publicationcategory Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı en_US
gdc.description.scopusquality Q3
gdc.description.startpage 225 en_US
gdc.description.volume 34 en_US
gdc.description.woscitationindex Science Citation Index Expanded
gdc.description.wosquality Q4
gdc.identifier.openalex W181187632
gdc.identifier.wos WOS:000285072300004
gdc.openalex.fwci 3.24735933
gdc.openalex.normalizedpercentile 0.9
gdc.openalex.toppercent TOP 10%
gdc.opencitations.count 26
gdc.plumx.crossrefcites 26
gdc.plumx.mendeley 29
gdc.plumx.scopuscites 33
gdc.scopus.citedcount 33
gdc.wos.citedcount 23
relation.isAuthorOfPublication b041782c-c0f7-4a21-9b8b-dfca759b4cd1
relation.isAuthorOfPublication.latestForDiscovery b041782c-c0f7-4a21-9b8b-dfca759b4cd1
relation.isOrgUnitOfPublication feeb877a-7c62-4053-b58b-2fac63c3d764
relation.isOrgUnitOfPublication 43797d4e-4177-4b74-bd9b-38623b8aeefa
relation.isOrgUnitOfPublication 0b9123e4-4136-493b-9ffd-be856af2cdb1
relation.isOrgUnitOfPublication.latestForDiscovery feeb877a-7c62-4053-b58b-2fac63c3d764

Files