Abderrahmane Bensmaine
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Abderrahmane Bensmaine has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Mohammed Dahane
Université de Lorraine, LGIPM, Metz, France
7 shared publications Lyes Benyoucef
6 shared publications- Farouk Yalaoui
Université de Technologie de Troyes
1 shared publication L. Benyoucef
1 shared publicationL.H. Mousss
1 shared publication- Lamia Triqui-Sari
Abou Bekr Belkaid University of Tlemcen
1 shared publication
Latest Publications
- 31 March 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Algorithmes évolutionnaires et méthodes approchées multicritères pour la génération des processus de fabrication dans un environnement reconfigurable
Le contexte incertain des marchés actuels a contribué au développement des systèmes manufacturiers, donnant lieu à des systèmes ayant des principes et des fonctionnalités multiples, qui essayent de répondre aux exigences changeantes. Les systèmes manufacturiers reconfigurables (RMS) constituent une classe des systèmes où les machines, les composants des machines ainsi que le système de manutention peuvent être ajoutés, modifiés, supprimés ou échangés selon les besoins de la production. Un RMS combine le haut débit des systèmes manufacturiers dédiés avec la flexibilité des systèmes flexibles. Le principal composant d'un RMS est la machine reconfigurable (RMT) qui possède une structure qui permet sa reconfiguration. Nous consacrons ce travail au problème de génération des plannings de fabrication dans un RMS, en exploitant au mieux les hauts degrés de reconfigurabilité des RMTs pour proposer des plannings efficaces. Trois problèmes liés à la fonction de génération des plannings de fabrication sont considérés : (1) la génération des process plans dans un cas unitaire où nous avons adaptés des techniques d'optimisation multicritère (NSGA-II et AMOSA), (2) la génération des process plans dans le cas multiunité où une optimisation basée sur la simulation a été adaptée, et (3) l'intégration des fonctions de génération des process plans avec l'ordonnancement où nous avons développé une nouvelle heuristique permettant d'effectuer cette intégration Toutes les approches proposées ont été validées par des expériences numériques, démontrant leur applicabilité et efficacité
- 31 March 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Algorithmes évolutionnaires et méthodes approchées multicritères pour la génération des processus de fabrication dans un environnement reconfigurable
Le contexte incertain des marchés actuels a contribué au développement des systèmes manufacturiers, donnant lieu à des systèmes ayant des principes et des fonctionnalités multiples, qui essayent de répondre aux exigences changeantes. Les systèmes manufacturiers reconfigurables (RMS) constituent une classe des systèmes où les machines, les composants des machines ainsi que le système de manutention peuvent être ajoutés, modifiés, supprimés ou échangés selon les besoins de la production. Un RMS combine le haut débit des systèmes manufacturiers dédiés avec la flexibilité des systèmes flexibles. Le principal composant d'un RMS est la machine reconfigurable (RMT) qui possède une structure qui permet sa reconfiguration. Nous consacrons ce travail au problème de génération des plannings de fabrication dans un RMS, en exploitant au mieux les hauts degrés de reconfigurabilité des RMTs pour proposer des plannings efficaces. Trois problèmes liés à la fonction de génération des plannings de fabrication sont considérés : (1) la génération des process plans dans un cas unitaire où nous avons adaptés des techniques d'optimisation multicritère (NSGA-II et AMOSA), (2) la génération des process plans dans le cas multiunité où une optimisation basée sur la simulation a été adaptée, et (3) l'intégration des fonctions de génération des process plans avec l'ordonnancement où nous avons développé une nouvelle heuristique permettant d'effectuer cette intégration Toutes les approches proposées ont été validées par des expériences numériques, démontrant leur applicabilité et efficacité
- 1 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Routing Planning of the Different Harvester for Organizing the Harvesting of Sugar Beet
This article proposes a planning of the routing path of the different beet lifters for the organization of the beet sugar harvest. The start of the production for sugar extraction is related to replenishment of the sugar beet, its synchronization with the date of operation of a set of harvesters is very critical. However, sugar beet is a biennial plant. Which gives more constraint for sugar production, which requires a thorough and precise study on the transport and storage of beet sugar in this study, our approach consists in proposing a harvesting circuit between the different places of cultivation of the sugar beet in the western region of Algeria. Our objective is to determine the necessary number of harvesters, in order to reduce the Investment cost relative to harvesters. In a second part, we compare two scenarios for replenishment of sugar beet. In the first scenario, the transfer of sugar beet is send directly to the production unit. In the second scenario, sugar beet is stored in zone storage cooperatives. Certainly this planning can help policy makers and farmers to work together to optimize transport, cost and time for the harvesting and processing areas
- 1 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Routing Planning of the Different Harvester for Organizing the Harvesting of Sugar Beet
This article proposes a planning of the routing path of the different beet lifters for the organization of the beet sugar harvest. The start of the production for sugar extraction is related to replenishment of the sugar beet, its synchronization with the date of operation of a set of harvesters is very critical. However, sugar beet is a biennial plant. Which gives more constraint for sugar production, which requires a thorough and precise study on the transport and storage of beet sugar in this study, our approach consists in proposing a harvesting circuit between the different places of cultivation of the sugar beet in the western region of Algeria. Our objective is to determine the necessary number of harvesters, in order to reduce the Investment cost relative to harvesters. In a second part, we compare two scenarios for replenishment of sugar beet. In the first scenario, the transfer of sugar beet is send directly to the production unit. In the second scenario, sugar beet is stored in zone storage cooperatives. Certainly this planning can help policy makers and farmers to work together to optimize transport, cost and time for the harvesting and processing areas
- 11 December 2013
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 52 (12) , 3583-3594
A new heuristic for integrated process planning and scheduling in reconfigurable manufacturing systems
National audienceIntegrated process planning and scheduling (IPPS) is a manufacturing strategy that considers process planning and scheduling as an integrated function rather than two separated functions performed sequentially. In this paper, we propose a new heuristic to IPPS problem for reconfigurable manufacturing systems (RMS). An RMS consists mainly of reconfigurable machine tools (RMTs), each with multiple configurations, and can perform different operations with different capacities. The proposed heuristic takes into account the multi-configuration nature of machines to integrate both process planning and scheduling. To illustrate the applicability and the efficiency of the proposed heuristic, a numerical example is presented where the heuristic is compared to a classical sequential process planning and scheduling strategy using a discrete-event simulation framework. The results show an advantage of the proposed heuristic over the sequential process planning and scheduling strategy
- 11 December 2013
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 52 (12) , 3583-3594
A new heuristic for integrated process planning and scheduling in reconfigurable manufacturing systems
National audienceIntegrated process planning and scheduling (IPPS) is a manufacturing strategy that considers process planning and scheduling as an integrated function rather than two separated functions performed sequentially. In this paper, we propose a new heuristic to IPPS problem for reconfigurable manufacturing systems (RMS). An RMS consists mainly of reconfigurable machine tools (RMTs), each with multiple configurations, and can perform different operations with different capacities. The proposed heuristic takes into account the multi-configuration nature of machines to integrate both process planning and scheduling. To illustrate the applicability and the efficiency of the proposed heuristic, a numerical example is presented where the heuristic is compared to a classical sequential process planning and scheduling strategy using a discrete-event simulation framework. The results show an advantage of the proposed heuristic over the sequential process planning and scheduling strategy
- 1 November 2013
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 66 (3) , 519-524
A non-dominated sorting genetic algorithm based approach for optimal machines selection in reconfigurable manufacturing environment
- 1 November 2013
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 66 (3) , 519-524
A non-dominated sorting genetic algorithm based approach for optimal machines selection in reconfigurable manufacturing environment
- 1 October 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 958-963
AMOSA Based Approach for Process Plan Generation in Reconfigurable Manufacturing System with Machine Load Balancing
Recent years have seen the development of a new manufacturing paradigm that responses to market changes cost-effectively, called Reconfigurable Manufacturing System (RMS). A RMS consists mainly of reconfigurable machines that give the system the capability to be reconfigurable. Each reconfigurable machine has multiple configurations with different capabilities and functionalities. In this paper we address the problem of process plan generation in Reconfigurable manufacturing systems taking into account the multiconfiguration nature of machines, as well as the state of the manufacturing system in term of already existing process planning. More specifically, we propose an approach that generates process plans with the consideration of other products on the system if they exist. The consideration of previously introduced products is justified by the fact that resources are shared among all products, which affects the overall machine load balancing, The problem is resolved using AMOSA (Archived MultiObjective Simulated Annealing) and the results discussed.
- 1 October 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 958-963
AMOSA Based Approach for Process Plan Generation in Reconfigurable Manufacturing System with Machine Load Balancing
Recent years have seen the development of a new manufacturing paradigm that responses to market changes cost-effectively, called Reconfigurable Manufacturing System (RMS). A RMS consists mainly of reconfigurable machines that give the system the capability to be reconfigurable. Each reconfigurable machine has multiple configurations with different capabilities and functionalities. In this paper we address the problem of process plan generation in Reconfigurable manufacturing systems taking into account the multiconfiguration nature of machines, as well as the state of the manufacturing system in term of already existing process planning. More specifically, we propose an approach that generates process plans with the consideration of other products on the system if they exist. The consideration of previously introduced products is justified by the fact that resources are shared among all products, which affects the overall machine load balancing, The problem is resolved using AMOSA (Archived MultiObjective Simulated Annealing) and the results discussed.
- 1 January 2013
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 46 (9) , 1961-1966
A Simulation-based Genetic Algorithm Approach for Process Plans Selection in Uncertain Reconfigurable Environment
- 1 January 2013
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 46 (9) , 1961-1966
A Simulation-based Genetic Algorithm Approach for Process Plans Selection in Uncertain Reconfigurable Environment
- 1 May 2012
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 45 (6) , 1672-1677
Genetic Algorithm Based Approaches for the Modified Weibull Renewal Approximation
- 1 May 2012
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 45 (6) , 1672-1677
Genetic Algorithm Based Approaches for the Modified Weibull Renewal Approximation
- 1 May 2012
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 45 (6) , 560-565
Process Plan Generation in Reconfigurable Manufacturing Systems using AMOSA and TOPSIS
- 1 May 2012
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 45 (6) , 560-565
Process Plan Generation in Reconfigurable Manufacturing Systems using AMOSA and TOPSIS
- 1 September 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Simulation-based NSGA-II approach for multi-unit process plans generation in reconfigurable manufacturing system
In response to the limitations of existing manufacturing systems and the fast changing environments, reconfigurable manufacturing systems (RMSs) have been proposed as a promising means for companies to manufacture products while meeting individualized customer requirements. In this paper, a simulation based Non dominated Sorting Genetic Algorithm (NSGA-II) approach is proposed to solve the problem of process plans generation for multi-unit single-product type observed in RMS. More specifically, multi-unit macro-level process plans are established in order to schedule different parts/operations on several machines, and where a process plan is associated to each unit in a reconfigurable environment. To demonstrate the applicability of the proposed approach, an illustrative example is presented and the numerical results discussed.
- 1 September 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Simulation-based NSGA-II approach for multi-unit process plans generation in reconfigurable manufacturing system
In response to the limitations of existing manufacturing systems and the fast changing environments, reconfigurable manufacturing systems (RMSs) have been proposed as a promising means for companies to manufacture products while meeting individualized customer requirements. In this paper, a simulation based Non dominated Sorting Genetic Algorithm (NSGA-II) approach is proposed to solve the problem of process plans generation for multi-unit single-product type observed in RMS. More specifically, multi-unit macro-level process plans are established in order to schedule different parts/operations on several machines, and where a process plan is associated to each unit in a reconfigurable environment. To demonstrate the applicability of the proposed approach, an illustrative example is presented and the numerical results discussed.
- 1 July 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19354576,p. 863-868
Process plan generation in reconfigurable manufacturing systems using adapted NSGA-II and AMOSA
Reconfigurable manufacturing system (RMS) is a manufacturing paradigm that cost-effectively responses to market changes. This paper addresses the multi-objective process plan generation problem in RMS. More specifically, two meta-heuristics, namely Non-dominated Sorting Genetic Algorithm (NSGA-II) and Archived Multi-Objective Simulated Annealing (AMOSA), are adapted to generate near-optimal process plans. With the help of a numerical example, the performances of the two metaheuristics are demonstrated and compared.
- 1 July 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19354576,p. 863-868
Process plan generation in reconfigurable manufacturing systems using adapted NSGA-II and AMOSA
Reconfigurable manufacturing system (RMS) is a manufacturing paradigm that cost-effectively responses to market changes. This paper addresses the multi-objective process plan generation problem in RMS. More specifically, two meta-heuristics, namely Non-dominated Sorting Genetic Algorithm (NSGA-II) and Archived Multi-Objective Simulated Annealing (AMOSA), are adapted to generate near-optimal process plans. With the help of a numerical example, the performances of the two metaheuristics are demonstrated and compared.