New heuristics for flow shop problem to minimize makespan / D. Bai in Journal of the operational research society (JORS), Vol. 61 N° 6 (Juin 2010)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 61 N° 6 (Juin 2010) . - pp. 1032–1040 Titre : New heuristics for flow shop problem to minimize makespan Type de document : texte imprimé Auteurs : D. Bai, Auteur ; Tang, L., Auteur Année de publication : 2011 Article en page(s) : pp. 1032–1040 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling Flow shop problem Makespan Performance analysis of algorithm Index. décimale : 001.424 Résumé : This paper investigates the flow shop problem with the objective to minimize makespan. New algorithms are designed: one is off-line heuristic, Single Job First, for problem Fm∥Cmax; and the other is on-line heuristic, Dynamic Single Job First (DSJF), for problem Fm|ri|Cmax and its on-line version. It is proved that the two heuristics are asymptotically optimal when the size of the problem is large enough. In addition, the asymptotical optimality of First-Come, First-Served manner is obtained as a byproduct of the asymptotical analysis of DSJF heuristic. At the end of the paper, a new lower bound with performance guarantee is provided for problem Fm∥Cmax, and computational experiments show the effectiveness of these heuristic algorithms. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n6/abs/jors200944a.html [article] New heuristics for flow shop problem to minimize makespan [texte imprimé] / D. Bai, Auteur ; Tang, L., Auteur . - 2011 . - pp. 1032–1040. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 6 (Juin 2010) . - pp. 1032–1040 Mots-clés : Scheduling Flow shop problem Makespan Performance analysis of algorithm Index. décimale : 001.424 Résumé : This paper investigates the flow shop problem with the objective to minimize makespan. New algorithms are designed: one is off-line heuristic, Single Job First, for problem Fm∥Cmax; and the other is on-line heuristic, Dynamic Single Job First (DSJF), for problem Fm|ri|Cmax and its on-line version. It is proved that the two heuristics are asymptotically optimal when the size of the problem is large enough. In addition, the asymptotical optimality of First-Come, First-Served manner is obtained as a byproduct of the asymptotical analysis of DSJF heuristic. At the end of the paper, a new lower bound with performance guarantee is provided for problem Fm∥Cmax, and computational experiments show the effectiveness of these heuristic algorithms. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n6/abs/jors200944a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire