scholarly journals Development of search method for sequencing problem in mixed-model assembly lines

2016 ◽  
Vol 10 (3) ◽  
pp. JAMDSM0048-JAMDSM0048 ◽  
Author(s):  
Aya ISHIGAKI ◽  
Tomoyuki MIYASHITA
2013 ◽  
Vol 655-657 ◽  
pp. 1675-1681
Author(s):  
Shu Xu ◽  
Fu Ming Li

On the base of summarizing and contrasting the objectives of sequencing problem in mixed model assembly lines (MMAL) , and in consideration of the influence sequence-dependent setup times , a objective is proposed to minimize the total unfinished works and idle times over all jobs and stations . And the corresponding model is presented. To solve this model, a modified genetic algorithm is proposed to determine suitable sequences. Comparing with the Lingo 9 software, the proposed GA turns out to have a good ability to solve the sequencing problems.


2014 ◽  
Vol 670-671 ◽  
pp. 1593-1600 ◽  
Author(s):  
Li Nie ◽  
Yue Wei Bai ◽  
Jun Wu ◽  
Chang Tao Pang

The manufacturers nowadays are forced to respond very quickly to changes in the market conditions. To adopt flexible mixed model assembly lines (MMAL) is a preferred way for manufacturers to improve competitiveness. Managing a mixed model assembly line involves two problems: assigning assembly tasks to stations (balancing problem) and determining the sequence of products at each station (sequencing problem). In order to solve both balancing and sequencing problem in MMAL simultaneously, an integrated mathematical model based on mixed integer programming (MIP) is developed to describe the problem. In the model, general type precedence relations and task duplications are considered. Due to the NP-hardness of the balancing and sequencing problem of MMAL, GA is designed to search the optimal solution. The efficiency of the GA is demonstrated by a case study.


Procedia CIRP ◽  
2016 ◽  
Vol 41 ◽  
pp. 201-206 ◽  
Author(s):  
Stefan Keckl ◽  
Wolfgang Kern ◽  
Antoin Abou-Haydar ◽  
Engelbert Westkämper

Sign in / Sign up

Export Citation Format

Share Document