A Genetic Algorithm for Robotic Assembly Line Balancing

Levitin, Gregory; Rubinovitz, Jacob; Shnits, Boris

doi:10.3182/20020721-6-es-1901.00016

Cited by 46 publications

(78 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…There is continuing work in applying GA for various types of line balancing problems, i.e. Leu et al (1994), Rubinovitz (1995), Kim et al (2000), Rekiek et al (2001), Goncalves (2002), Simaria and Vilarinho (2004), Zhang et al (2005), Haq et al (2006), Levitin et al (2006), Suwannarongsri et al (2007), Zhang et al (2008, Hwang andKatayama (2009), Yu andYin (2010), Chica et al (2011), Akpinar and Bayhan (2011), and . In particular, Kim et al (2000), Kim et al (2009), Taha et al (2011), Rabbani et al (2012, and Purnomo et al PTALBP has not been addressed using any GA based technique.…”

Section: Etc)mentioning

confidence: 99%

A mathematical model and genetic algorithm-based approach for parallel two-sided assembly line balancing problem

Küçükkoç

Zhang

2015

Production Planning & Control

View full text Add to dashboard Cite

Section: Etc)mentioning

confidence: 99%

A mathematical model and genetic algorithm-based approach for parallel two-sided assembly line balancing problem

Küçükkoç

Zhang

2015

Production Planning & Control

View full text Add to dashboard Cite

“…The alterations are biologically-derived techniques, commonly achieved by inheritance, mutation and crossover. Multiple Genetic Algorithms were designed for mixed model assembly lines such as [24], [25], [26] and [27].…”

Section: Heuristic Approach: Gamentioning

confidence: 99%

Semi-dynamic Demand in a Non-permutation Flowshop with Constrained Resequencing Buffers

Färber

Salhi

Moreno

2008

Large-Scale Scientific Computing

View full text Add to dashboard Cite

Abstract. This work presents the performance comparison of two conceptually different approaches for a mixed model non-permutation flowshop production line. The demand is a semi-dynamic demand with a fixed job sequence for the first station. Resequencing is permitted where stations have access to intermediate or centralized resequencing buffers. The access to the buffers is restricted by the number of available buffer places and the physical size of the products. An exact approach, using Constraint Logic Programming (CLP), and a heuristic approach, a Genetic Algorithm (GA), were applied.

show abstract

“…Bukchin and Rubinovitz [12] present the problem with the possibility of parallel stations; this work is an extension of Bukchin and Tzur [13], and the solution uses an adaptation of the B&B procedure presented in that work. Levitin et al [14] solve the problem on robotised assembly lines using a genetic algorithm that they compare with a truncated B&B.…”

Section: Literature Reviewmentioning

confidence: 99%

Balancing assembly line with skilled and unskilled workers

Corominas

Pastor

Plans

2008

Omega

113

View full text Add to dashboard Cite

In this paper, we present the process of rebalancing the line at motorcycle-assembly plant. The company found it necessary to rebalance its line, since it needs to increase production in the spring and summer months. The main characteristics of the problem are as follows: (i) the company hires temporary staff, who need more time to carry out their tasks than permanent workers; (ii) there must always be at least one skilled employee working alongside an unskilled one; and (iii) different task groups are incompatible with each other (clean-hands tasks and dirty-hands tasks). The goal is to minimise the number of temporary workers required, given a cycle time and the team of workers on staff. The problem is modelled as a binary linear program (BLP) and solved optimally by means of the ILOG CPLEX 9.0 optimiser. The solution provided, namely 12 permanent workers (skilled) and two temporary workers (unskilled), is an improvement on the solution implemented by the business, which involved 12 permanent workers and four temporary workers.

show abstract

A Genetic Algorithm for Robotic Assembly Line Balancing

Cited by 46 publications

References 2 publications

A mathematical model and genetic algorithm-based approach for parallel two-sided assembly line balancing problem

A mathematical model and genetic algorithm-based approach for parallel two-sided assembly line balancing problem

Semi-dynamic Demand in a Non-permutation Flowshop with Constrained Resequencing Buffers

Balancing assembly line with skilled and unskilled workers

Contact Info

Product

Resources

About