A fuzzy greedy heuristic for permutation flow-shop scheduling / K. Sheibani in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 813–818 Titre : A fuzzy greedy heuristic for permutation flow-shop scheduling Type de document : texte imprimé Auteurs : K. Sheibani, Auteur Année de publication : 2010 Article en page(s) : pp. 813–818 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Combinatorial optimization Flow-shop scheduling Heuristics Index. décimale : 001.424 Résumé : This paper describes a polynomial-time heuristic for the permutation flow-shop scheduling problem with the makespan criterion. The proposed method consists of two phases: arranging the jobs in priority order and then constructing a sequence. A fuzzy greedy evaluation function is employed to prioritize the jobs for incorporating into the construction phase of the heuristic. Computational experiments using standard benchmark problems indicate an improvement of the new heuristic over the well-known Nawaz, Enscore and Ham (NEH) heuristic. It will be seen that the NEH heuristic is a special case of our more general heuristic. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors2008194a.html [article] A fuzzy greedy heuristic for permutation flow-shop scheduling [texte imprimé] / K. Sheibani, Auteur . - 2010 . - pp. 813–818. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 813–818 Mots-clés : Combinatorial optimization Flow-shop scheduling Heuristics Index. décimale : 001.424 Résumé : This paper describes a polynomial-time heuristic for the permutation flow-shop scheduling problem with the makespan criterion. The proposed method consists of two phases: arranging the jobs in priority order and then constructing a sequence. A fuzzy greedy evaluation function is employed to prioritize the jobs for incorporating into the construction phase of the heuristic. Computational experiments using standard benchmark problems indicate an improvement of the new heuristic over the well-known Nawaz, Enscore and Ham (NEH) heuristic. It will be seen that the NEH heuristic is a special case of our more general heuristic. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors2008194a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire