Saturday, 19 de April de 2014

Ficha del recurso:

Fuente:

Vínculo original en INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 50 (10):2710-2719; 10.1080/00207543.2011.588617 2012
Ying, KC

Última actualización:

Thursday, 28 de June de 2012

Entrada en el observatorio:

Thursday, 28 de June de 2012

Idioma:

Inglés

Archivado en:


Scheduling identical wafer sorting parallel machines with sequence-dependent setup times using an iterated greedy heuristic

Wafer sorting is one of the most critical processes involved in semiconductor device fabrication. This study addresses the wafer sorting scheduling problem (WSSP), with minimisation of total setup time as the primary criterion and minimisation of the number of testers used as the secondary criterion. In view of the strongly NP-hard nature of this problem, a simple and effective iterated greedy heuristic is presented. The performance of the proposed heuristic is empirically evaluated by 480 simulation instances based on the characteristics of a real wafer testing shop-floor. The experimental results show that the proposed heuristic is effective and efficient as compared to the state-of-art algorithms developed for the same problem. It is believed that this study has developed an approach that is easy to comprehend and satisfies the practical needs of wafer sorting.