Balancing two-sided assembly lines with sequence-dependent setup times

Özcan, Uğur; Toklu, Bilal

doi:10.1080/00207540903140750

Cited by 77 publications

(45 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The set of constraints (18) guarantees that each task in any workstation would have at most one immediate successor. It is possible to do only one forward setup operation between any pair of tasks due to constraints (19) and there would not be any forward setup operation between any task and itself due to constraints (20). Constraint set (21) ensures that each workstation would have just one backward setup operation.…”

Section: B Ijmnmentioning

confidence: 99%

“…For the Type-II version of the problem, [25] described a mathematical model similar to that in [4], and a simulated annealing (SA) algorithm. A mixed-integer programming formulation for another version of the problem where setup times were considered for a two sided assembly line was presented in [20], for which the authors proposed a heuristic. The mixed-model version of the assembly line balancing problem with setups was studied in [18], and the variant with sequence dependent setup times between tasks was studied in [2], and hybrid meta-heuristic algorithms, including a combination of ant colony optimization and genetic algorithm and a multiple colony hybrid bees algorithm were described in [1] and [3].…”

mentioning

confidence: 99%

See 1 more Smart Citation

Combinatorial Benders cuts for assembly line balancing problems with setups

Akpınar

Elmi

Bektaş

2017

European Journal of Operational Research

View full text Add to dashboard Cite

The classical assembly line balancing problem consists of assigning assembly work to workstations.In the presence of setup times that depend on the sequence of tasks assigned to each workstation, the problem becomes more complicated given that two interdependent problems, namely assignment and sequencing, must be solved simultaneously. The hierarchical nature of these two problems also suggest a natural decomposition of the problem. This paper adopts such an approach and describes an exact algorithm based on Benders decomposition to solve both simple and mixed-model assembly line balancing problems with setups. The algorithm is tested on a set of benchmark instances and numerically compared against a mixed-integer linear programming formulation of the problem solved using an off-the-shelf optimizer.

show abstract

Section: B Ijmnmentioning

confidence: 99%

mentioning

confidence: 99%

Combinatorial Benders cuts for assembly line balancing problems with setups

Akpınar

Elmi

Bektaş

2017

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…Heuristic approaches were proposed by Bartholdi (1993), Lee et al (2001), Hu et al (2008), Ozcan and Toklu (2010), Yegul et al (2010), Yin et al (2011) and exact solution approaches by Wu et al (2008) and Hu et al (2010). Meta-heuristics have also been presented to address twosided assembly line balancing problem, i.e.…”

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

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

“…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%

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

Balancing two-sided assembly lines with sequence-dependent setup times

Cited by 77 publications

References 20 publications

Combinatorial Benders cuts for assembly line balancing problems with setups

Combinatorial Benders cuts for assembly line balancing problems with setups

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

Contact Info

Product

Resources

About