부산대학교 도서관

In industrial production, minimizing the idle time during assembly line reorganization in product switching is very important for management organizations. To increase efficiency, instead of taking the products that are expected to be produced in different and numerous varieties into the assembly line in indiscriminate order, it is necessary to schedule them in the order that requires the minimum setup time and start production in this way. In this study, the problem of minimizing machine setup time in assembly line workstations in product switching is mathematically modeled, and the problem is proved to be from the NP-hard class. In addition, 3 modified heuristic algorithms and 2 hybrid genetic algorithms are presented for the problem of product switching processes, and their performance is compared by running on 20 test problems. [ABSTRACT FROM AUTHOR]