Documents disponibles écrits par cet auteur

Metaheuristics for scheduling jobs with incompatible families on parallel batching machines / C. Almeder in Journal of the operational research society (JORS), Vol. 62 N° 12 (Décembre 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 12 (Décembre 2011) . - pp. 2083–2096 Titre : Metaheuristics for scheduling jobs with incompatible families on parallel batching machines Type de document : texte imprimé Auteurs : C. Almeder, Auteur ; L. Mönch, Auteur Année de publication : 2011 Article en page(s) : pp. 2083–2096 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Batching  Scheduling  Ant  colony  optimization  Variable  neighbourhood  search  Total  weighted  tardiness Index. décimale : 001.424 Résumé : In this paper, we discuss the scheduling of jobs with incompatible families on parallel batching machines. The performance measure is total weighted tardiness. This research is motivated by a scheduling problem found in the diffusion and oxidation areas of semiconductor wafer fabrication where the machines can be modelled as parallel batch processors. Given that this scheduling problem is NP-hard, we suggest an ant colony optimization (ACO) and a variable neighbourhood search (VNS) approach. Both metaheuristics are hybridized with a decomposition heuristic and a local search scheme. We compare the performance of the two algorithms with that of a genetic algorithm (GA) based on extensive computational experiments. The VNS approach outperforms the ACO and GA approach with respect to time and solution quality. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n12/abs/jors2010186a.html [article] Metaheuristics for scheduling jobs with incompatible families on parallel batching machines [texte imprimé] / C. Almeder, Auteur ; L. Mönch, Auteur . - 2011 . - pp. 2083–2096. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 12 (Décembre 2011) . - pp. 2083–2096 Mots-clés : Batching  Scheduling  Ant  colony  optimization  Variable  neighbourhood  search  Total  weighted  tardiness Index. décimale : 001.424 Résumé : In this paper, we discuss the scheduling of jobs with incompatible families on parallel batching machines. The performance measure is total weighted tardiness. This research is motivated by a scheduling problem found in the diffusion and oxidation areas of semiconductor wafer fabrication where the machines can be modelled as parallel batch processors. Given that this scheduling problem is NP-hard, we suggest an ant colony optimization (ACO) and a variable neighbourhood search (VNS) approach. Both metaheuristics are hybridized with a decomposition heuristic and a local search scheme. We compare the performance of the two algorithms with that of a genetic algorithm (GA) based on extensive computational experiments. The VNS approach outperforms the ACO and GA approach with respect to time and solution quality. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n12/abs/jors2010186a.html