Transforming part-sequencing problems in a robotic cell into a GTSP / Zahrouni, W. in Journal of the operational research society (JORS), Vol. 62 N° 1 (Janvier 2011)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 114–123 Titre : Transforming part-sequencing problems in a robotic cell into a GTSP Type de document : texte imprimé Auteurs : Zahrouni, W., Auteur ; Kamoun, H., Auteur Année de publication : 2011 Article en page(s) : pp. 114–123 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling Sequencing Heuristics Flexible manufacturing systems Index. décimale : 001.424 Résumé : This paper shows how to solve two-part sequencing problems in a three-machine robotic cell so as to minimize the cycle time. We start dealing with cycles whose associated part-sequencing problems do not have the structure of a travelling salesman problem (TSP). The idea behind our approach is to modify the waiting time formula and formulate the closely related modified problem as a generalized travelling salesman problem (GTSP). The other cycles to be tackled are those that have a TSP structure for their associated part-sequencing problem. The existence of common states between these cycles allows us to mix and mould all of them into a GTSP. The solution procedures, designed for both cycle classes, are merged into a single heuristic and evaluated. The computational results provided prove the efficiency of the approaches. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009158a.html [article] Transforming part-sequencing problems in a robotic cell into a GTSP [texte imprimé] / Zahrouni, W., Auteur ; Kamoun, H., Auteur . - 2011 . - pp. 114–123. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 1 (Janvier 2011) . - pp. 114–123 Mots-clés : Scheduling Sequencing Heuristics Flexible manufacturing systems Index. décimale : 001.424 Résumé : This paper shows how to solve two-part sequencing problems in a three-machine robotic cell so as to minimize the cycle time. We start dealing with cycles whose associated part-sequencing problems do not have the structure of a travelling salesman problem (TSP). The idea behind our approach is to modify the waiting time formula and formulate the closely related modified problem as a generalized travelling salesman problem (GTSP). The other cycles to be tackled are those that have a TSP structure for their associated part-sequencing problem. The existence of common states between these cycles allows us to mix and mould all of them into a GTSP. The solution procedures, designed for both cycle classes, are merged into a single heuristic and evaluated. The computational results provided prove the efficiency of the approaches. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n1/abs/jors2009158a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire