Multi-objective optimization of greening scheduling problems of part feeding for mixed model assembly lines based on the robotic mobile fulfillment system

Author(s):  
Binghai Zhou ◽  
Zhexin Zhu
2013 ◽  
Vol 321-324 ◽  
pp. 2110-2115
Author(s):  
Zhi Li ◽  
Zhao Liang Jiang

Multi-mixed model assembly lines (MMMALs) sequencing cooperative optimization is a typical problem that a variety of products models are assembled in multiple assembly lines. It extends the traditional products sequencing from MMAL to MMMALs. In this paper, we pose products assembly sequencing in multi-mixed model assembly lines (MMMALs) as a multiple-objective optimization problem with the objectives to minimize consumption waviness of each material in the lines, total setup cost and finished product inventory cost. The multi-objective optimization algorithm based on NSGAII is designed. Computational experiment has been demonstrated to the applicability of using NSGAII to solve the problem and effectiveness of the proposed approach. By means of this research, the valid solutions for products assembly sequence can be offered to the decision makers effectively.


2011 ◽  
Vol 24 (2) ◽  
pp. 119-141 ◽  
Author(s):  
Jenny Golz ◽  
Rico Gujjula ◽  
Hans-Otto Günther ◽  
Stefan Rinderer ◽  
Marcus Ziegler

Author(s):  
Mudassar Rauf ◽  
◽  
Mirza Jahanzaib ◽  
Muhammad Haris Aziz ◽  
◽  
...  

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Masood Fathi ◽  
Maria Jesus Alvarez ◽  
Farhad Hassani Mehraban ◽  
Victoria Rodríguez

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.


2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Francesco Costantino ◽  
Alberto Felice De Toni ◽  
Giulio Di Gravio ◽  
Fabio Nonino

The authors deal with the topic of the final assembly scheduling realized by the use of genetic algorithms (GAs). The objective of the research was to study in depth the use of GA for scheduling mixed-model assembly lines and to propose a model able to produce feasible solutions also according to the particular requirements of an important Italian motorbike company, as well as to capture the results of this change in terms of better operational performances. The “chessboard shifting” of work teams among the mixed-model assembly lines of the selected company makes the scheduling problem more complex. Therefore, a complex model for scheduling is required. We propose an application of the GAs in order to test their effectiveness to real scheduling problems. The high quality of the final assembly plans with high adherence to the delivery date, obtained in a short elaboration time, confirms that the choice was right and suggests the use of GAs in other complex manufacturing systems.


Sign in / Sign up

Export Citation Format

Share Document