کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1133922 | 1489092 | 2014 | 9 صفحه PDF | دانلود رایگان |
• A real-life two-sided assembly line balancing problem (TALBP) is considered.
• The problem includes additional assignment restrictions.
• Teaching–learning based optimization (TLBO) algorithm is employed.
• A high quality solution is obtained in a short computational time.
Assembly line balancing plays a crucial role in modern manufacturing companies in terms of the growth in productivity and reduction in costs. The problem of assigning tasks to consecutive stations in such a way that one or more objectives are optimized subject to the required tasks, processing times and some specific constraints is called the assembly line balancing problem (ALBP). Depending on production tactics and distinguishing working conditions in practice, assembly line systems show a large diversity. Although, a growing number of researchers addressed ALBP over the past fifty years, real-world assembly systems which require practical extensions to be considered simultaneously have not been adequately handled. This study deals with an industrial assembly system belonging to the class of two-sided line with additional assignment restrictions which are often encountered in practice. Teaching–learning based optimization (TLBO), which is a recently developed nature-inspired search method, is employed to solve the line balancing problem. Computational results are compared with the current situation in terms of the line efficiency, and the solution structure with workload assigned to the stations is presented.
Journal: Computers & Industrial Engineering - Volume 74, August 2014, Pages 291–299