Houssem Eddine Nouri

• PhD
• Professor (Assistant) at Institut Supérieur d'Informatique et de Gestion de Kairouan

In today's rapidly evolving manufacturing landscape, the efficient allocation of human resources is crucial for optimizing production systems. This paper addresses the dual resource-constrained flexible job shop scheduling problem (DRCFJSP) by implementing a Multi-Start Tabu Search-based Multi-Agent Model (MuSTAM). MuSTAM considers a set of initial...

In many industrial real-world environments, scheduling necessitates continual reactive adjustments due to unpredictable perturbations, leading to the dynamic transformation of predefined static schedules. In this paper, we introduce a new framework named a two-level evolutionary algorithm (2LEA) as a comprehensive approach for addressing the dynami...

To cope with the growing demand for multimedia services, the 3rd Generation Partnership Project (3GPP) has introduced the Multimedia Broadcast/Multicast Service (MBMS) to better distribute multimedia content over mobile network, particularly in the context of the Multicast Single Frequency Network (MBSFN). The conventional approach specified in the...

The permutation flow shop scheduling problem (PFSP), known as an NP-Hard problem, is one of the most interesting scheduling problems for its important theoretical and practical structure, and continues to receive much attention due to its applications in several real industries such as food processing, chemical manufacturing, plastics production an...

Over the past few years, there has been a growing trend in the research community to focus on the scheduling problems associated with resource constraints. This paper deals specifically with the Dual-Resource Constrained Flexible Job shop Scheduling Problem (DRCFJSP), which is a well-known NP-hard problem. This problem is aimed at minimizing the ma...

Heterogeneous Wireless Sensor Networks (HWSN) are more complex to manage because nodes do not have equivalent characteristics such as communication, computational, and energy heterogeneity. Our work considers the energy heterogeneity not only to optimize the energy-efficient clustering process but also to improve the lifetime performance. In this p...

Supply chain management consists of optimising production process from raw material sourcing to final product, logistics and delivery to the final customer. In this context, we propose for the first time the hybridization of two metaheuristic algorithms, the cat swarm optimization and the genetic algorithm, for a simultaneous resolution of the open...

The dynamic flexible job shop scheduling problem (DyFJSP) is an extension of the flexible job scheduling problem (FJSP) as the production environment is characterized by a set of disturbances that require a method capable of reacting in real time in order to generate an efficient schedule in case of production failure. In this paper, we propose a b...

Typically, processing jobs on a production floor require both machines and human resources. However, most classical scheduling problems ignore possible constraints caused by the availability of workers and treat machines only as limited resource. This paper presents a Multi-Start Tabu Agents-based Model (MuSTAM) for Dual-Resource Constrained Flexib...

There is always a component of the field of Human-Machine Interactions (HMI) which constantly tries to provide solutions to the problems relating to adaptation, in order to move towards more ergonomic approaches and more flexible and adaptive tools. It is in this context that this research work is taking place, which will consider an adaptation of...

Recently, deep learning has presented a new field of investigation for researchers in machine learning and has made it more artificial intelligence. Many domains of application are concerned by deep learning, such as health, education, robotics, surveillance, sports, etc., and more precisely Convolutional Neural Network (CNN). In fact, the CNN has...

Benchmark data instances for the Multi-Objective Flexible Job shop Scheduling Problem with Worker flexibility

In robotic systems, the control of some elements such as transport robot has some difficulties when planning operations dynamically. The Flexible Job Shop scheduling Problem with Transportation times and a Single Robot (FJSPT-SR) is a generalization of the classical Job Shop scheduling Problem (JSP) where a set of jobs additionally have to be trans...

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to...

In real manufacturing environments, the control of some elements in systems based on robotic cells, such as transport robots has some difficulties when planning operations dynamically. The Job Shop scheduling Problem with Transportation times and Many Robots (JSPT-MR) is a generalization of the classical Job Shop scheduling Problem (JSP) where a se...

In systems based robotic cells, the control of some elements such as transport robot has some difficulties when planning operations dynamically. The Flexible Job Shop scheduling Problem with Transportation times and Many Robots (FJSPT-MR) is a generalization of the classical Job Shop scheduling Problem (JSP) where a set of jobs have to be transport...

This paper proposes a multi-agent model for solving the university course timetabling problem. It is composed of cooperating agents enabling highly distributed processing of the problem and incorporating constraints that have not been considered by previous works. The aim of our model is to provide a best solution satisfying hard and soft constrain...

The Job Shop scheduling Problem (JSP) is one of the most known problems in the domain of the production task scheduling. The Job Shop scheduling Problem with Transportation resources (JSPT) is a generalization of the classical JSP consisting of two sub-problems: the job scheduling problem and the generic vehicle scheduling problem. In this paper, w...

The Flexible Job Shop scheduling Problem (FJSP) is an extension of the classical Job Shop scheduling Problem (JSP) that allows to process operations on one machine out of a set of alternative machines. It is an NP-hard problem consisting of two sub-problems which are the assignment and the scheduling problems. This paper proposes a hybridization of...

The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop scheduling Problem (JSP) allowing to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the machine assignment and the operation scheduling problems. In this pape...

The Flexible Job Shop scheduling Problem (FJSP) is an extension of the classical Job Shop scheduling Problem (JSP) that allows to process operations on one machine out of a set of alternative machines. It is an NP-hard problem consisting of two sub-problems which are the assignment and the scheduling problems. This paper proposes a hybridization of...

The Flexible Job Shop scheduling Problem (FJSP) is an extension of the classical Job Shop scheduling Problem (JSP) that allows to process operations on one machine out of a set of alternative machines. It is an NP-hard problem consisting of two sub-problems which are the assignment and the scheduling problems. This paper proposes a holonic multiage...

The Flexible Job Shop scheduling Problem (FJSP) is an extension of the classical Job Shop scheduling Problem (JSP) presenting an additional difficulty caused by the operation assignment problem on one machine out of a set of alternative machines. The FJSP is an NP-hard problem composed by two complementary problems, which are the assignment and the...

Les problèmes d’ordonnancement des personnels sont devenus de plus en plus diffusés dans notre vie réelle. Le problème d’emploi du temps est une instance des problèmes d’ordonnancement des tâches et en particulier des problèmes d’ordonnancement des personnels, il est bien connu comme un problème NP-complet. Il joue un rôle très important dans plusi...

This paper proposes a multi-agent model for solving the university course timetabling problem named M.A.T.P (Multi-Agent model for university Timetabling Problem). Our model is based on cooperative and negotiating agents enabling highly parallel and distributed processing of the problem and incorporating new constraints that have not been taken int...

We are interested, in this paper, to solve the university course timetabling problem. We present a multi-agent model named M.A.T.P (Multi-Agent model for university Timetabling Problem). Our model is based on cooperative agents enabling highly parallel and distributed processing of the problem and incorporating new constraints that have not been ta...

We are interested, in this paper, to solve the university course timetabling problem. We present a multi-agent model named M.A.T.P (Multi-Agent model for university Timetabling Problem). Our model is based on cooperative agents enabling highly parallel and distributed processing of the problem and incorporating new constraints that have not been ta...