TITLE

A Multiobjective Optimization Algorithm to Solve the Part Feeding Problem in Mixed-Model Assembly Lines

AUTHOR(S)
Fathi, Masood; Alvarez, Maria Jesus; Mehraban, Farhad Hassani; Rodríguez, Victoria
PUB. DATE
January 2014
SOURCE
Mathematical Problems in Engineering;2014, p1
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Different aspects of assembly line optimization have been extensively studied. Part feeding at assembly lines, however, is quite an undeveloped area of research. This study focuses on the optimization of part feeding at mixed-model assembly lines with respect to the Just-In-Time principle motivated by a real situation encountered at one of the major automobile assembly plants in Spain. The study presents a mixed integer linear programming model and a novel simulated annealing algorithm-based heuristic to pave the way for the minimization of the number of tours as well as inventory level. In order to evaluate the performance of the algorithm proposed and validate the mathematical model, a set of generated test problems and two real-life instances are solved. The solutions found by both the mathematical model and proposed algorithm are compared in terms of minimizing the number of tours and inventory levels, as well as a performance measure called workload variation. The results show that although the exact mathematical model had computational difficulty solving the problems, the proposed algorithm provides good solutions in a short computational time.
ACCESSION #
100526854

 

Related Articles

  • A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem. Sewell, E. C.; Jacobson, S. H. // INFORMS Journal on Computing;Summer2012, Vol. 24 Issue 3, p433 

    We present a new exact algorithm for the assembly line balancing problem. The algorithm finds and verifies the optimal solution for every problem in the combined benchmarks of Hoffmann, Talbot, and Scholl in less than one-half second per problem, on average, including one problem that has...

  • BUFFER SPACE ALLOCATION IN AUTOMATED ASSEMBLY LINES. Smith, J. MacGregor; Daskalaki, Sophia // Operations Research;Mar/Apr88, Vol. 36 Issue 2, p343 

    Automated assembly lines are modeled as finite open queueing networks and a heuristic for buffer space allocation within these lines is presented. The Expansion Method, an analytical technique for modeling finite open queueing networks and Powell's unconstrained optimization procedure are...

  • Practical ABC intelligence solution for Quadratic Assignment. Behzadi, Golnar; Sundarakani, Balan // Proceedings of the International Conference on Industrial Engine;2014, p959 

    One of the key challenges in the scope of NP-hard problems is associated with finding a suitable solution algorithm as a result of degrees of complexity integrated in such problems. Among that, Quadratic assignment problems (QAPs) have considerable popularity because of various real-world...

  • Are You Really Repairing That?  // Electrical Construction & Maintenance Exclusive Insight;12/8/2015, p3 

    The article presents a scenario of troubleshooting a drive system of a production line which has stopped during the production.

  • Synchronous Unpaced Flow Lines with Worker Differences and Overtime Cost. Doerr, Kenneth H.; Klastorin, Theodore D.; Magazine, Michael J. // Management Science;Mar2000, Vol. 46 Issue 3, p421 

    In this paper, we consider the design of a synchronous, unpaced flow line where workers operate at different skill levels and overtime is used, if necessary, to meet a daily production quota. The line is unpaced in the sense that items only move to the next workstation when all workers on the...

  • A novel memetic ant colony optimization-based heuristic algorithm for solving the assembly line part feeding problem. Fathi, Masood; Rodríguez, Victoria; Alvarez, Maria // International Journal of Advanced Manufacturing Technology;Oct2014, Vol. 75 Issue 1-4, p629 

    In recent years, part feeding at assembly lines has become a critical issue as the result of a high level of product customization. The assembly line part feeding problem is a complex problem in which a number of decisions should be made in order to select the right quantity of each part to be...

  • A Bottleneck Detection Algorithm for Complex Product Assembly Line Based on Maximum Operation Capacity. Dongping Zhao; Xitian Tian; Junhao Geng // Mathematical Problems in Engineering;2014, p1 

    Because of the complex constraints in complex product assembly line, existing algorithms not always detect bottleneck correctly and they have a low convergence rate. In order to solve this problem, a hybrid algorithm of adjacency matrix and improved genetic algorithm (GA) was proposed. First,...

  • An efficient algorithm for maximizing the expected profit from a serial production line with inspection stations and rework. Raviv, Tal // OR Spectrum;Jul2013, Vol. 35 Issue 3, p609 

    In this paper, an unreliable serial production line in which nonconforming items are sent back for rework is studied. The line consists of existing machines and optional quality control stations (QCSs). The designer of such a production line needs to decide where to install the QCSs along the...

  • Mixed-Model Two-Sided Assembly Line Balancing Using a Modified Genetic Algorithm. Taha, Raghda B.; El-Kharbotly, Amin; Afia, Nahid; Sadek, Yomna // Proceedings of the International Conference on Industrial Engine;2012, p1168 

    Mixed model two-sided assembly lines can be found today in many industrial environments. They are now-a-days replacing the traditional mass production assembly lines with the growing trend for greater product variability and shorter life cycles. In this paper a Modified Genetic Algorithm is used...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics