Meta-heuristic algorithms for wafer sorting scheduling problems / Lin, Shih-Wei in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 165–174 Titre : Meta-heuristic algorithms for wafer sorting scheduling problems Type de document : texte imprimé Auteurs : Lin, Shih-Wei, Auteur ; Lee, Zne-Jung, Auteur ; Ying, Kuo-Ching, Auteur Année de publication : 2011 Article en page(s) : pp. 165–174 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Wafer sorting scheduling problem Meta-heuristic Parallel machine Index. décimale : 001.424 Résumé : Wafer sorting is usually regarded as the most critical stage in the whole wafer probing process. This paper discusses the wafer sorting scheduling problem (WSSP) with total setup time minimization as the primary criterion and the minimization of the number of machines used as the secondary criterion. Although the need to consider multiple criteria in real-world WSSPs is widely recognized, the present study is the first attempt to investigate this argument with setups consideration. In view of the strongly NP-hard nature of this problem, three meta-heuristic algorithms—an ant colony system algorithm, a Genetic algorithm, and a Tabu search algorithm are proposed. The proposed meta-heuristics are empirically evaluated by 480 simulation instances based on the characteristics of a real wafer testing shop-floor and found to be very effective in terms of finding good quality solutions. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009182a.html [article] Meta-heuristic algorithms for wafer sorting scheduling problems [texte imprimé] / Lin, Shih-Wei, Auteur ; Lee, Zne-Jung, Auteur ; Ying, Kuo-Ching, Auteur . - 2011 . - pp. 165–174. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 165–174 Mots-clés : Wafer sorting scheduling problem Meta-heuristic Parallel machine Index. décimale : 001.424 Résumé : Wafer sorting is usually regarded as the most critical stage in the whole wafer probing process. This paper discusses the wafer sorting scheduling problem (WSSP) with total setup time minimization as the primary criterion and the minimization of the number of machines used as the secondary criterion. Although the need to consider multiple criteria in real-world WSSPs is widely recognized, the present study is the first attempt to investigate this argument with setups consideration. In view of the strongly NP-hard nature of this problem, three meta-heuristic algorithms—an ant colony system algorithm, a Genetic algorithm, and a Tabu search algorithm are proposed. The proposed meta-heuristics are empirically evaluated by 480 simulation instances based on the characteristics of a real wafer testing shop-floor and found to be very effective in terms of finding good quality solutions. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009182a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire