Les Inscriptions à la Bibliothèque sont ouvertes en
ligne via le site: https://biblio.enp.edu.dz
Les Réinscriptions se font à :
• La Bibliothèque Annexe pour les étudiants en
2ème Année CPST
• La Bibliothèque Centrale pour les étudiants en Spécialités
A partir de cette page vous pouvez :
Retourner au premier écran avec les recherches... |
Détail de l'auteur
Auteur J-M Yu
Documents disponibles écrits par cet auteur
Affiner la rechercheIterative algorithms for part grouping and loading in cellular reconfigurable manufacturing systems / J-M Yu in Journal of the operational research society (JORS), Vol. 63 N° 12 (Décembre 2012)
[article]
in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1635–1644
Titre : Iterative algorithms for part grouping and loading in cellular reconfigurable manufacturing systems Type de document : texte imprimé Auteurs : J-M Yu, Auteur ; H-H Doh, Auteur ; H-W. Kim, Auteur Année de publication : 2013 Article en page(s) : pp. 1635–1644 Note générale : operational research Langues : Anglais (eng) Mots-clés : cellular reconfigurable manufacturing systems; part grouping; loading; iterative algorithms Index. décimale : 001.424 Résumé : A reconfigurable manufacturing system (RMS), one of state-of-the-art manufacturing system technologies, is the one designed at the outset for rapid changes in its hardware and software components in order to quickly adjust its production capacity and functionality in response to market or system changes. In this study, we consider a cellular RMS with multiple reconfigurable machining cells (RMCs), each of which has numerical control machines, a setup station, and an automatic material handling and storage system. Each machine within the RMC has an automatic tool changer and a tool magazine of a limited capacity. Two important operational problems, part grouping and loading, are considered in this study. Part grouping is the problem of allocating parts to RMCs, and loading is the problem of allocating operations and their cutting tools to machines within the RMC. An integer programming model is suggested to represent the two problems at the same time for the objective of balancing the workloads assigned to machines. Then, due to the complexity of the problem, we suggest two iterative algorithms in which the two problems are solved repeatedly until a solution is obtained. Computational experiments were done on various test instances and the results are reported. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors20129a.html [article] Iterative algorithms for part grouping and loading in cellular reconfigurable manufacturing systems [texte imprimé] / J-M Yu, Auteur ; H-H Doh, Auteur ; H-W. Kim, Auteur . - 2013 . - pp. 1635–1644.
operational research
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1635–1644
Mots-clés : cellular reconfigurable manufacturing systems; part grouping; loading; iterative algorithms Index. décimale : 001.424 Résumé : A reconfigurable manufacturing system (RMS), one of state-of-the-art manufacturing system technologies, is the one designed at the outset for rapid changes in its hardware and software components in order to quickly adjust its production capacity and functionality in response to market or system changes. In this study, we consider a cellular RMS with multiple reconfigurable machining cells (RMCs), each of which has numerical control machines, a setup station, and an automatic material handling and storage system. Each machine within the RMC has an automatic tool changer and a tool magazine of a limited capacity. Two important operational problems, part grouping and loading, are considered in this study. Part grouping is the problem of allocating parts to RMCs, and loading is the problem of allocating operations and their cutting tools to machines within the RMC. An integer programming model is suggested to represent the two problems at the same time for the objective of balancing the workloads assigned to machines. Then, due to the complexity of the problem, we suggest two iterative algorithms in which the two problems are solved repeatedly until a solution is obtained. Computational experiments were done on various test instances and the results are reported. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors20129a.html