Minimizing the total completion time in a two-machine flowshop with sequence-independent setup times / T. Ladhari in Journal of the operational research society (JORS), Vol. 63 N° 4 (Avril 2012)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 63 N° 4 (Avril 2012) . - pp. 445–459 Titre : Minimizing the total completion time in a two-machine flowshop with sequence-independent setup times Type de document : texte imprimé Auteurs : T. Ladhari, Auteur ; M. K. Msakni, Auteur ; A. Allahverdi, Auteur Année de publication : 2012 Article en page(s) : pp. 445–459 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling Flowshop Total completion time Independent setup times Heuristics Genetic local search algorithm Index. décimale : 001.424 Résumé : We consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop subject to setup times. We propose a new priority rule, several constructive heuristics, local search procedures, as well as an effective multiple crossover genetic algorithm. Computational experiments carried out on a large set of randomly generated instances provide evidence that a constructive heuristic based on newly derived priority rule dominates all the proposed constructive heuristics. More specifically, we show that one of our proposed constructive heuristics outperforms the best constructive heuristic in the literature in terms of both error and computational time. Furthermore, we show that one of our proposed local search-based heuristics outperforms the best local search heuristic in the literature in terms of again both error and computational time. We also show that, in terms of quality-to-CPU time ratio, the multiple crossover genetic algorithm performs consistently well. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n4/abs/jors201137a.html [article] Minimizing the total completion time in a two-machine flowshop with sequence-independent setup times [texte imprimé] / T. Ladhari, Auteur ; M. K. Msakni, Auteur ; A. Allahverdi, Auteur . - 2012 . - pp. 445–459. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 4 (Avril 2012) . - pp. 445–459 Mots-clés : Scheduling Flowshop Total completion time Independent setup times Heuristics Genetic local search algorithm Index. décimale : 001.424 Résumé : We consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop subject to setup times. We propose a new priority rule, several constructive heuristics, local search procedures, as well as an effective multiple crossover genetic algorithm. Computational experiments carried out on a large set of randomly generated instances provide evidence that a constructive heuristic based on newly derived priority rule dominates all the proposed constructive heuristics. More specifically, we show that one of our proposed constructive heuristics outperforms the best constructive heuristic in the literature in terms of both error and computational time. Furthermore, we show that one of our proposed local search-based heuristics outperforms the best local search heuristic in the literature in terms of again both error and computational time. We also show that, in terms of quality-to-CPU time ratio, the multiple crossover genetic algorithm performs consistently well. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n4/abs/jors201137a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire