| Titre : | Transforming part-sequencing problems in a robotic cell into a GTSP (2011) |
| Auteurs : | Zahrouni, W., Auteur ; Kamoun, H., Auteur |
| Type de document : | Article : texte imprimé |
| Dans : | Journal of the operational research society (JORS) (Vol. 62 N° 1, Janvier 2011) |
| Article en page(s) : | pp. 114–123 |
| Note générale : | Recherche opérationnelle |
| Langues : | Anglais |
| Index. décimale : | 001.424 |
| Tags : | Scheduling Sequencing Heuristics Flexible manufacturing systems |
| 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 |
