Abdelhak Elidrissi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Abdelhak Elidrissi has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Rachid Benmansour
SI2M Laboratory, INSEA, Rabat, Morocco
7 shared publications - David Duvivier
LAMIH UMR CNRS 8201, Polytechnic University of Hauts-de-France
3 shared publications Mohammed Benbrahim
MOAD6 Team, MASI Laboratory, Mohammadia School of Engineers, Mohammed V University, Rabat, Morocco
3 shared publications- Angelo Sifaleras
Department of Applied Informatics, School of Information Sciences, University of Macedonia, Thessaloniki, Greece
2 shared publications Keramat Hasani
2 shared publications- Oualid Benbrik
SI2M Laboratory, INSEA, Rabat, Morocco
2 shared publications
Latest Publications
- 2 January 2026
- Published by Springer Nature
- p. 171-182
Maximum Lateness Minimization on Two-Parallel Machine with a Non-availability Interval
- 2 January 2026
- Published by Springer Nature
- p. 171-182
Maximum Lateness Minimization on Two-Parallel Machine with a Non-availability Interval
- 5 June 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 328 (1) , 15-31
A reduction approach for the parallel machine scheduling problem with a separate server for loading and unloading operations
- 5 June 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 328 (1) , 15-31
A reduction approach for the parallel machine scheduling problem with a separate server for loading and unloading operations
- 27 November 2024
- Published by Springer Nature in Environmental Monitoring and Assessment
- Vol. 196 (12) , 1-25
A hybrid deep learning model–based LSTM and modified genetic algorithm for air quality applications
Over time, computing power and storage resource advancements have enabled the widespread accumulation and utilization of data across various domains. In the field of air quality, analyzing data and developing air quality models have become pivotal in safeguarding public health. Despite significant progress in modeling, the critical need for accurate pollutant predictions persists. In addressing this challenge, deep learning models have garnered substantial attention in research due to their outstanding performance across diverse applications. However, the optimization of hyperparameters and features remains a challenging task. This study seeks to leverage historical data to construct the long short-term memory–based model for forecasting multistep PM10. To refine its architecture, a modified genetic algorithm is employed for automatic design. Furthermore, we explore principal component analysis and exhaustive feature selection to identify the optimal feature set. This paper introduces a novel hybrid deep learning model named EFS-GA-LSTM, tailored for multistep hourly PM10 forecasting. To assess its performance, we compare it with other hyperparameter optimization algorithms, including particle swarm optimization, variable neighborhood search, and Bayesian optimization with Gaussian process. The input dataset comprises hourly PM10 concentrations, meteorological variables, and time variables. The results reveal that for 3-h-ahead forecasting tasks, the EFS-GA-LSTM network demonstrates improvements in root mean square error, mean absolute percentage error, correlation coefficient, and coefficient of determination.
- 27 November 2024
- Published by Springer Nature in Environmental Monitoring and Assessment
- Vol. 196 (12) , 1-25
A hybrid deep learning model–based LSTM and modified genetic algorithm for air quality applications
Over time, computing power and storage resource advancements have enabled the widespread accumulation and utilization of data across various domains. In the field of air quality, analyzing data and developing air quality models have become pivotal in safeguarding public health. Despite significant progress in modeling, the critical need for accurate pollutant predictions persists. In addressing this challenge, deep learning models have garnered substantial attention in research due to their outstanding performance across diverse applications. However, the optimization of hyperparameters and features remains a challenging task. This study seeks to leverage historical data to construct the long short-term memory–based model for forecasting multistep PM10. To refine its architecture, a modified genetic algorithm is employed for automatic design. Furthermore, we explore principal component analysis and exhaustive feature selection to identify the optimal feature set. This paper introduces a novel hybrid deep learning model named EFS-GA-LSTM, tailored for multistep hourly PM10 forecasting. To assess its performance, we compare it with other hyperparameter optimization algorithms, including particle swarm optimization, variable neighborhood search, and Bayesian optimization with Gaussian process. The input dataset comprises hourly PM10 concentrations, meteorological variables, and time variables. The results reveal that for 3-h-ahead forecasting tasks, the EFS-GA-LSTM network demonstrates improvements in root mean square error, mean absolute percentage error, correlation coefficient, and coefficient of determination.
- 25 November 2024
- Published by Springer Nature in Annals of Operations Research
- Vol. 351 (1) , 1109-1154
Efficient algorithms for the bucket wheel reclaimer scheduling problem with sequence-dependent setup times
- 25 November 2024
- Published by Springer Nature in Annals of Operations Research
- Vol. 351 (1) , 1109-1154
Efficient algorithms for the bucket wheel reclaimer scheduling problem with sequence-dependent setup times
- 17 June 2024
- Published by Springer Nature
- p. 291-308
Advanced Algorithms for the Reclaimer Scheduling Problem with Sequence-Dependent Setup Times and Availability Constraints
- 17 June 2024
- Published by Springer Nature
- p. 291-308
Advanced Algorithms for the Reclaimer Scheduling Problem with Sequence-Dependent Setup Times and Availability Constraints
- 19 July 2023
- Published by Springer Nature in 4OR
- Vol. 22 (3) , 351-385
Minimization of maximum lateness on parallel machines with a single server and job release dates
- 19 July 2023
- Published by Springer Nature in 4OR
- Vol. 22 (3) , 351-385
Minimization of maximum lateness on parallel machines with a single server and job release dates
- Open Access
Scheduling on parallel machines with a common server in charge of loading and unloading operations
This paper addresses the scheduling problem on two identical parallel machines with a single server in charge of loading and unloading operations of jobs. Each job has to be loaded by the server before being processed on one of the two machines and unloaded by the same server after its processing. No delay is allowed between loading and processing, and between processing and unloading. The objective function involves the minimization of the makespan. This problem referred to as P2, S1|sj , tj |Cmax generalizes the classical parallel machine scheduling problem with a single server which performs only the loading (i.e., setup) operation of each job. For this NP-hard problem, no solution algorithm was proposed in the literature. Therefore, we present two mixedinteger linear programming (MILP) formulations, one with completion-time variables along with two valid inequalities and one with time-indexed variables. In addition, we propose some polynomial-time solvable cases and a tight theoretical lower bound. In addition, we show that the minimization of the makespan is equivalent to the minimization of the total idle times on the machines. To solve large-sized instances of the problem, an efficient General Variable Neighborhood Search (GVNS) metaheuristic with two mechanisms for finding an initial solution is designed. The GVNS is evaluated by comparing its performance with the results provided by the MILPs and another metaheuristic. The results show that the average percentage deviation from the theoretical lower-bound of GVNS is within 0.642%. Some managerial insights are presented and our results are compared with the related literature.
Open AccessScheduling on parallel machines with a common server in charge of loading and unloading operations
This paper addresses the scheduling problem on two identical parallel machines with a single server in charge of loading and unloading operations of jobs. Each job has to be loaded by the server before being processed on one of the two machines and unloaded by the same server after its processing. No delay is allowed between loading and processing, and between processing and unloading. The objective function involves the minimization of the makespan. This problem referred to as P2, S1|sj , tj |Cmax generalizes the classical parallel machine scheduling problem with a single server which performs only the loading (i.e., setup) operation of each job. For this NP-hard problem, no solution algorithm was proposed in the literature. Therefore, we present two mixedinteger linear programming (MILP) formulations, one with completion-time variables along with two valid inequalities and one with time-indexed variables. In addition, we propose some polynomial-time solvable cases and a tight theoretical lower bound. In addition, we show that the minimization of the makespan is equivalent to the minimization of the total idle times on the machines. To solve large-sized instances of the problem, an efficient General Variable Neighborhood Search (GVNS) metaheuristic with two mechanisms for finding an initial solution is designed. The GVNS is evaluated by comparing its performance with the results provided by the MILPs and another metaheuristic. The results show that the average percentage deviation from the theoretical lower-bound of GVNS is within 0.642%. Some managerial insights are presented and our results are compared with the related literature.
- Open Access
- 10 September 2022
- Published by Springer Nature in Optimization Letters
- Vol. 17 (9) , 2201-2231
General variable neighborhood search for the parallel machine scheduling problem with two common servers
We address in this paper the parallel machine scheduling problem with a shared loading server and a shared unloading server. Each job has to be loaded by the loading server before being processed on one of the available machines and unloaded immediately by the unloading server after its processing. The objective function involves the minimization of the overall completion time, known as the makespan. This important problem raises in flexible manufacturing systems, automated material handling, healthcare, and many other industrial fields, and has been little studied up to now. To date, research on it has focused on the case of two machines. The regular case of this problem is considered. A mixed integer programming formulation based on completion time variables is suggested to solve small-sized instances of the problem. Due to its $$\mathcal{NP}\mathcal{}$$ -hardness, we propose two greedy heuristics based on the minimization of the loading, respectively unloading, server waiting time, and an efficient General Variable Neighborhood Search (GVNS) algorithm. In the computational experiments, the proposed methods are compared using 120 new and publicly available instances. It turns out that, the proposed GVNS with an initial solution-finding mechanism based on the unloading server waiting time minimization significantly outperforms the other approaches.- 10 September 2022
- Published by Springer Nature in Optimization Letters
- Vol. 17 (9) , 2201-2231
Open AccessGeneral variable neighborhood search for the parallel machine scheduling problem with two common servers
We address in this paper the parallel machine scheduling problem with a shared loading server and a shared unloading server. Each job has to be loaded by the loading server before being processed on one of the available machines and unloaded immediately by the unloading server after its processing. The objective function involves the minimization of the overall completion time, known as the makespan. This important problem raises in flexible manufacturing systems, automated material handling, healthcare, and many other industrial fields, and has been little studied up to now. To date, research on it has focused on the case of two machines. The regular case of this problem is considered. A mixed integer programming formulation based on completion time variables is suggested to solve small-sized instances of the problem. Due to its $$\mathcal{NP}\mathcal{}$$ -hardness, we propose two greedy heuristics based on the minimization of the loading, respectively unloading, server waiting time, and an efficient General Variable Neighborhood Search (GVNS) algorithm. In the computational experiments, the proposed methods are compared using 120 new and publicly available instances. It turns out that, the proposed GVNS with an initial solution-finding mechanism based on the unloading server waiting time minimization significantly outperforms the other approaches. - 25 August 2020
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 59 (20) , 6166-6184
Mathematical formulations for the parallel machine scheduling problem with a single server
This paper addresses the problem of scheduling independent jobs on identical parallel machines with a single server to minimise the makespan. We propose mixed integer programming (MIP) formulations to solve this problem. Each formulation reflects a specific concept on how the decision variables are defined. Moreover, we present inequalities that can be used to improve those formulations. A computational study is performed on benchmark instances from the literature to compare the proposed MIP formulations with other known formulations from the literature. It turns out that our proposed time-indexed variables formulation outperforms by far the other formulations. In addition, we propose a very efficient MIP formulation to solve a particular case of the problem with a regular job set. This formulation is able to solve all regular instances for the case of 500 jobs and 5 machines in less than 5.27 min, where all other formulations are not able to produce a feasible solution within 1 h.
- 25 August 2020
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 59 (20) , 6166-6184
Mathematical formulations for the parallel machine scheduling problem with a single server
This paper addresses the problem of scheduling independent jobs on identical parallel machines with a single server to minimise the makespan. We propose mixed integer programming (MIP) formulations to solve this problem. Each formulation reflects a specific concept on how the decision variables are defined. Moreover, we present inequalities that can be used to improve those formulations. A computational study is performed on benchmark instances from the literature to compare the proposed MIP formulations with other known formulations from the literature. It turns out that our proposed time-indexed variables formulation outperforms by far the other formulations. In addition, we propose a very efficient MIP formulation to solve a particular case of the problem with a regular job set. This formulation is able to solve all regular instances for the case of 500 jobs and 5 machines in less than 5.27 min, where all other formulations are not able to produce a feasible solution within 1 h.