A tabu search algorithm for two-sided assembly line balancing

Özcan, Uğur; Toklu, Bilal

doi:10.1007/s00170-008-1753-5

Cited by 104 publications

(46 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Meta-heuristics have also been presented to address twosided assembly line balancing problem, i.e. Baykasoglu and Dereli (2008), Simaria and Vilarinho (2009), Ozcan and Toklu (2009b), Ozbakir and Tapkan (2010), Ozcan (2010), Ozbakir and Tapkan (2011), Chutima and Chimklai (2012). Among these meta-heuristics, the studies of Kim et al (2000Kim et al ( , 2009, Taha et al (2011), Purnomo et al (2013), and Rabbani et al (2012) employ different variations of genetic algorithm to balance two-sided lines.…”

Section: International Journal Of Production Researchmentioning

confidence: 99%

“…Cercioglu et al (2009) proposed a simulated annealing approach to solve PALBP and compared obtained results with the results of existing heuristic algorithm proposed by Gokcen et al (2006). Ozcan et al (2009) developed the first multi-objective tabu search algorithm for PALBP and tested the performance of the algorithm on a set of well-known problems in the literature. Scholl and Boysen (2009) modelled the PALBP mathematically and proposed an exact solution procedure.…”

Section: International Journal Of Production Researchmentioning

confidence: 99%

See 1 more Smart Citation

Simultaneous balancing and sequencing of mixed-model parallel two-sided assembly lines

Küçükkoç

Zhang

2014

International Journal of Production Research

View full text Add to dashboard Cite

Growing interests from customers in customised products and increasing competitions among peers necessitate companies to configure their manufacturing systems more effectively than ever before. We propose a new assembly line system configuration for companies that need intelligent solutions to satisfy customised demands on time with existing resources. A mixed-model parallel two-sided assembly line system is introduced based on the parallel two-sided assembly line system previously proposed by Ozcan et al. (Balancing parallel two-sided assembly lines, International Journal of Production Research, 48 (16), 4767-4784, 2010). The mixed-model parallel two-sided assembly line balancing problem is illustrated with examples from the perspective of simultaneous balancing and sequencing. An agent based ant colony optimisation algorithm is proposed to solve the problem. This algorithm is the first attempt in the literature to solve an assembly line balancing problem with an agent based ant colony optimisation approach. The algorithm is illustrated with an example and its operational procedures and principles explained and discussed.Keywords: mixed-model parallel two-sided assembly lines; assembly line balancing; agent based ant colony optimisation; meta-heuristics; artificial intelligence

show abstract

Section: International Journal Of Production Researchmentioning

confidence: 99%

Section: International Journal Of Production Researchmentioning

confidence: 99%

Simultaneous balancing and sequencing of mixed-model parallel two-sided assembly lines

Küçükkoç

Zhang

2014

International Journal of Production Research

View full text Add to dashboard Cite

show abstract

“…Different heuristics (e.g., Lee et al (2001), Hu et al (2008), Ozcan and Toklu (2010), and Yegul et al (2010)) and meta-heuristics (e.g., Kim et al (2000;, Baykasoglu and Dereli (2008), Simaria and Vilarinho (2009), Ozcan and Toklu (2009b), Ozcan (2010), Tapkan (2010, 2011), Rabbani et al (2012), Chutima and Chimklai (2012), and Purnomo et al (2013)) were proposed for balancing the two-sided assembly lines. Some exact solution approaches have also been presented by Wu et al (2008) and Hu et al (2010) to solve the two-sided assembly line balancing problem optimally.…”

Section: Introductionmentioning

confidence: 99%

“…They showed that locating two straight lines in parallel helps minimize the total number of workstations. This was followed by other researches and new techniques have been developed for solving the problem (e.g., a shortest path approach by Benzer et al (2007), a tabu search algorithm by Ozcan et al (2009), an exact procedure by Scholl and Boysen (2009), a fuzzy goal programming model by Kara et al (2010), and ACO based approaches by Baykasoglu et al (2009) and ). The line parallelization idea has been applied to mixed-model lines and two-sided lines.…”

Section: Introductionmentioning

confidence: 99%

Mixed-model parallel two-sided assembly line balancing problem: A flexible agent-based ant colony optimization approach

Küçükkoç

Zhang

2016

Computers & Industrial Engineering

View full text Add to dashboard Cite

Assembly lines are frequently used as a production method to assemble complex products. Two-sided assembly lines are utilized to assemble large-sized products (e.g., cars, buses, trucks). Locating two lines in parallel helps improve line efficiency by enabling collaboration between the line workers. This paper proposes a mixed-model parallel twosided assembly line system that can be utilized to produce large-sized items in an inter-mixed sequence. The mixed-model parallel two-sided line balancing problem is defined and the advantages of utilizing multi-line stations across the lines are discussed. A flexible agent-based ant colony optimization algorithm is developed to solve the problem and a numerical example is given to explain the method systematically. The proposed algorithm builds flexible balancing solutions suitable for any model sequence launched. The dynamically changing workloads of workstations (based on specific product models during the production process) are also explored. A comprehensive experimental study is conducted and the results are statistically analyzed using the well-known paired sample t-test. The test results indicate that the mixed-model parallel two-sided assembly line system reduces the workforce need in comparison with separately balanced mixed-model two-sided lines. It is also shown that the proposed algorithm outperforms the tabu search algorithm and six heuristics often used in the assembly line balancing domain.  Section 3 has been re-written in elucidate manner. More explanations on acronyms used in Section 5.1 have been added for clarification. The manuscript has been carefully reviewed by an experienced proof-reader whose first language is English and who specializes in reviewing papers written by authors whose native language is not English.Our detailed responses to reviewer's comments have also been attached to this document.We hope that these revisions will be sufficient to make our manuscript suitable for publication in 'Computers & Industrial Engineering'. We believe that this study will become a base point for further works and yield more researches in this domain by attracting further interests from both academia and industry.We shall look forward to hearing from you at your earliest convenience. AbstractAssembly lines are frequently used as a production method to assemble complex products. Two-sided assembly lines are utilized to assemble large-sized products (e.g., Mixed-model Parallel Detailed Response to ReviewersOverall:The Authors have addressed all comments and queries, but still the paper needs some minor improvements. Response:Your comments are appreciated. All comments have been addressed individually and the blue font has been used in the revised paper to highlight the changes performed. Please find below the detailed responses to your comments. Comment-1:In proposed methodology, authors mentioned that heuristic and metaheuristic is used when it is hard to get solution, what does it mean? Response-1: Thank you for your comment. The sentence ...

show abstract

“…Literatürde tek ve çok modelli montaj hattı dengeleme problemi için yasak arama algoritması ve yasak arama algoritmasına dayalı melez yaklaşımlar kullanılmıştır [27,28,29,30,31,32,33,34]. Bununla birlikte farklı montaj hattı yerleşimleri olan paralel [35,36,37], çift taraflı [38], paralel çift taraflı [39] ve U-tipi [40,41] montaj hattı dengeleme problemleri için de yasak arama yaklaşımı önerilmiştir. Ayrıca montaj hattı sıralama (assembly line sequencing) problemi için yasak arama yaklaşımı kullanılan çalışmalar da görülmektedir [42,43,44,45].…”

unclassified

Yasak Arama Algori̇tmasina Dayali Pürüzsüzleşti̇rme Yaklaşimi İçeren Karişik-Modelli̇ Montaj Hatti Dengeleme

Yağmahan¹,

Emel²

2015

Gazi Üniversitesi Mühendislik-Mimarlık Fakültesi Dergisi

View full text Add to dashboard Cite

ÖZETKarışık-modelli montaj hatları, çeşitli modellerde talep edilen ürünlerin daha ucuz olacak şekilde montajı için kullanılır. Bu tür hatlar tasarlandığında, montaj hattının zaman, yer, konum vb. kısıtlar altında daha verimli ve düzenli bir şekilde çalışabilmesi için, istasyonlardaki işlemlerin dengelenmesi gerekir. Bu makalede, karışık-modelli montaj hattı dengeleme problemi için belli bir çevrim süresine karşılık istasyon sayısının minimizasyonunu amaçlayan bir sezgisel algoritma geliştirilmiştir. Ayrıca önerilen bir yasak arama algoritmasına dayalı pürüzsüzleştirme yaklaşımı ile istasyonlarda modellere ait ortak işlemlerdeki süre farklılıklarından kaynaklanan dengesizlikler giderilmeye çalışılmıştır.Anahtar Kelimeler: Karışık-model, montaj hattı dengeleme, yasak arama, pürüzsüzleştirme MIXED-MODEL ASSEMBLY LINE BALANCING WITH SMOOTHING APPROACH BASED ON TABU SEARCH ALGORITHM ABSTRACTMixed-model assembly lines are needed for the assembly of products with a variety of models at comparatively lower costs. The design of such lines requires the work to be done at stations well balanced, satisfying the constraints such as time, space and location for optimal productivity and efficiency. This paper presents a heuristic algorithm for the mixed-model assembly line balancing problem to minimize the number of stations for a given cycle time. The proposed algorithm further reduces time discrepancies among stations due to differences in times for common operations of different models by using a smoothing approach which is based on the tabu search algorithm.

show abstract

A tabu search algorithm for two-sided assembly line balancing

Cited by 104 publications

References 34 publications

Simultaneous balancing and sequencing of mixed-model parallel two-sided assembly lines

Simultaneous balancing and sequencing of mixed-model parallel two-sided assembly lines

Mixed-model parallel two-sided assembly line balancing problem: A flexible agent-based ant colony optimization approach

Yasak Arama Algori̇tmasina Dayali Pürüzsüzleşti̇rme Yaklaşimi İçeren Karişik-Modelli̇ Montaj Hatti Dengeleme

Contact Info

Product

Resources

About