Veuillez utiliser cette adresse pour citer ce document : http://dspace1.univ-tlemcen.dz/handle/112/1830
Titre: Real-time rescheduling metaheuristic algorithms applied to FMS with routing flexibility
Auteur(s): SOUIER, Mehdi
SARI, Zaki
HASSAM, Ahmed
Mots-clés: Flexible manufacturing systems
Alternative routing
Real-time routing selection method
Metaheuristics adaptation
Rescheduling
Date de publication: jan-2013
Résumé: This paper presents the results of a simulation study of a typical flexible manufacturing system that consists of seven machining centres, a loading and an unloading area, and six different part types. Owing to the existence of identical machining centres, the part types have alternative routings (their number varies between two and eight). One of the objectives of this work is to show how the following metaheuristics: ant colony optimisation, genetic algorithms, simulated annealing, tabu search, particle swarm optimisation and electromagnetism-like method, are adapted for solving the alternative routing selection problem in real time in order to reduce the congestion in the system by selecting a routing for each part among its alternative routings. The other goal is to highlight the impact of the real-time rescheduling of parts contained in the loading station on system performances when these metaheuristics are applied. The simulation results jugged by the production rate, machines and material handling utilisation rate show that for an overloaded system, the real-time rescheduling outperforms the case without rescheduling, but it has a negative impact on the work in process.
Description: The International Journal of Advanced Manufacturing Technology, ISSN : 0268-3768,DOI : 10.1007/s00170-012-4001-y, Issue : 1-4, Volume : 64, pp. 145-164, January 2013.
URI/URL: http://dspace.univ-tlemcen.dz/handle/112/1830
Collection(s) :Articles internationaux

Fichier(s) constituant ce document :
Fichier Description TailleFormat 
Real-time-rescheduling-metaheuristic-algorithms.pdf32,01 kBAdobe PDFVoir/Ouvrir


Tous les documents dans DSpace sont protégés par copyright, avec tous droits réservés.