Les Inscriptions à la Bibliothèque sont ouvertes en
ligne via le site: https://biblio.enp.edu.dz
Les Réinscriptions se font à :
• La Bibliothèque Annexe pour les étudiants en
2ème Année CPST
• La Bibliothèque Centrale pour les étudiants en Spécialités
A partir de cette page vous pouvez :
Retourner au premier écran avec les recherches... |
Détail de l'auteur
Auteur Ochoa, G.
Documents disponibles écrits par cet auteur
Affiner la rechercheOn the automatic discovery of variants of the NEH procedure for flow shop scheduling using genetic programming / Vázquez-Rodríguez, J. A. in Journal of the operational research society (JORS), Vol. 62 N° 2 Special issue (Fevrier 2011)
[article]
in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 381–396
Titre : On the automatic discovery of variants of the NEH procedure for flow shop scheduling using genetic programming Type de document : texte imprimé Auteurs : Vázquez-Rodríguez, J. A., Auteur ; Ochoa, G., Auteur Année de publication : 2011 Article en page(s) : pp. 381–396 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Heuristics Production Genetic programming Genetic algorithms Hyper-heuristics Index. décimale : 001.424 Résumé : We use genetic programming to find variants of the well-known Nawaz, En-score and Ham (NEH) heuristic for the permutation flow shop problem. Each variant uses a different ranking function to prioritize operations during schedule construction. We have tested our ideas on problems where jobs have release times, due dates, and weights and have considered five objective functions: makespan, sum of tardiness, sum of weighted tardiness, sum of completion times and sum of weighted completion times. The implemented genetic programming system has been carefully tuned and used to generate one variant of NEH for each objective function. The new NEHs, obtained with genetic programming, have been compared with the original NEH and randomized NEH versions on a large set of benchmark problems. Our results indicate that the NEH variants discovered by genetic programming are superior to the original NEH and its stochastic version on most of the problems investigated. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010132a.html [article] On the automatic discovery of variants of the NEH procedure for flow shop scheduling using genetic programming [texte imprimé] / Vázquez-Rodríguez, J. A., Auteur ; Ochoa, G., Auteur . - 2011 . - pp. 381–396.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 381–396
Mots-clés : Heuristics Production Genetic programming Genetic algorithms Hyper-heuristics Index. décimale : 001.424 Résumé : We use genetic programming to find variants of the well-known Nawaz, En-score and Ham (NEH) heuristic for the permutation flow shop problem. Each variant uses a different ranking function to prioritize operations during schedule construction. We have tested our ideas on problems where jobs have release times, due dates, and weights and have considered five objective functions: makespan, sum of tardiness, sum of weighted tardiness, sum of completion times and sum of weighted completion times. The implemented genetic programming system has been carefully tuned and used to generate one variant of NEH for each objective function. The new NEHs, obtained with genetic programming, have been compared with the original NEH and randomized NEH versions on a large set of benchmark problems. Our results indicate that the NEH variants discovered by genetic programming are superior to the original NEH and its stochastic version on most of the problems investigated. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors2010132a.html