پديدآورندگان :
Elahi Saeed School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran , Rabbani Masoud mrabani@ut.ac.ir School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran , Javadi Babak Department of Industrial Engineering, College of Farabi, University of Tehran, Qom, Iran
كليدواژه :
Zero , one integer programing , Assembly line balancing , Mixed , model U , lines , Tabu search algorithm
چكيده فارسي :
This paper presents a zero-one integer programing formulation for optimal balancing of mixed-model U-lines type I which minimizes the number of stations for given tasks of various models of a product. Due to the weakness of the complex model to solve large-sized problems, a Tabu search algorithm is developed and compared with optimal solutions of small and medium-sized problems through a comprehensive experimental analysis. The results show the effectiveness of the proposed algorithm to reach near-optimal solutions.
