Mehdi Serairi

Orcid: 0000-0001-7694-601X

According to our database1, Mehdi Serairi authored at least 17 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
GRASP-ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows.
Int. Trans. Oper. Res., 2023

2022
An Elitist Non-dominated Heuristic Resolution for the Dynamic Asset Protection Problem.
Proceedings of the Artificial Evolution, 2022

2021
Exact method for the two-machine flow-shop problem with time delays.
Ann. Oper. Res., 2021

2020
A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit.
Ann. Oper. Res., 2020

2019
The clustered team orienteering problem.
Comput. Oper. Res., 2019

2018
A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem.
RAIRO Oper. Res., 2018

2017
Hybrid Heuristic for the Clustered Orienteering Problem.
Proceedings of the Computational Logistics - 8th International Conference, 2017

A branch-and-bound algorithm for the two-machine flow-shop problem with time delays.
Proceedings of the 4th International Conference on Control, 2017

2016
Lower Bounds for the Two-Machine Flow Shop Problem with Time Delays.
Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016

2014
A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays.
RAIRO Oper. Res., 2014

A mixed integer programming approach for the single machine problem with unequal release dates.
Comput. Oper. Res., 2014

2013
The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies.
Eur. J. Oper. Res., 2013

Scheduling the two-machine open shop problem under resource constraints for setting the jobs.
Ann. Oper. Res., 2013

2011
Relaxations and exact solution of the variable sized bin packing problem.
Comput. Optim. Appl., 2011

2010
A Computational Study of Lower Bounds for the Two Dimensional Bin Packing Problem.
Electron. Notes Discret. Math., 2010

Polynomial Lower Bounds for the Two-Machine Flowshop Problem with Sequence-Independent Setup Times.
Electron. Notes Discret. Math., 2010

2009
Heuristics for the variable sized bin-packing problem.
Comput. Oper. Res., 2009


  Loading...