作者: C. Pornsing , A. Watanasungsuit
DOI: 10.1109/ICMIT.2014.6942474
关键词:
摘要: Due to government regulations, customer preferences, and cooperate finance interest, End-of-life (EOL) processing of products is becoming increasingly desirable. Reusing, recycling, remanufacturing, disposing are choices for its processing. Most all alternatives, disassembly may be needed. However, the process a relatively expensive due labor-intensive nature. Consequently, finding an optimal or near sequence This report presents method using discrete particle swarm optimization (PSO) solving sequencing problem. The idea applying PSO combinatorial problem proposed. Additionally, dynamic precedence matrix coping constraints presented. test results show that proposed effective efficient