Hatem Hadda

Orcid: 0000-0002-0010-8885

According to our database1, Hatem Hadda authored at least 19 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
Makespan Minimization for the Two-Stage Hybrid Flow Shop Problem with Dedicated Machines: A Comprehensive Study of Exact and Heuristic Approaches.
Comput., June, 2023

New characterizations for the identical coupled tasks scheduling problem.
RAIRO Oper. Res., March, 2023

New models for the two-sided assembly line balancing problem.
Int. J. Adv. Oper. Manag., 2023

2021
Heuristic algorithms for scheduling intrees on m machines with non-availability constraints.
Oper. Res., 2021

A Random-key based genetic algorithm for the flexible job-shop scheduling minimizing total completion time.
Proceedings of the 14th International Conference on Developments in eSystems Engineering, 2021

2018
On the optimality conditions of the two-machine flow shop problem.
Eur. J. Oper. Res., 2018

2016
Heuristic for Scheduling Intrees on m Machines with Non-availability Constraints.
Proceedings of the Intelligent Systems Design and Applications, 2016

2015
On the two-stage hybrid flow shop with dedicated machines.
RAIRO Oper. Res., 2015

The two-stage hybrid flow shop problem with dedicated machines under release dates and delivery times.
Int. J. Adv. Oper. Manag., 2015

2014
Exact resolution of the two-stage hybrid flow shop with dedicated machines.
Optim. Lett., 2014

The Two-stage Assembly Flow Shop Scheduling with an Availability Constraint: Worst Case Analysis.
J. Math. Model. Algorithms Oper. Res., 2014

A PTAS for a Particular Case of the Two-machine Flow Shop with Limited Machine Availability.
J. Math. Model. Algorithms Oper. Res., 2014

2013
A note on "A heuristic method for two-stage hybrid flow shop with dedicated machines".
Comput. Oper. Res., 2013

2012
A note on the two-stage hybrid flow shop problem with dedicated machines.
Optim. Lett., 2012

A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints.
Optim. Lett., 2012

2010
An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs.
4OR, 2010

An improved algorithm for the two machine flow shop problem with several availability constraints.
4OR, 2010

2009
Méthode heuristique pour le problème de flow shop hybride avec machines dédiées.
RAIRO Oper. Res., 2009

A (4/3)-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints.
Optim. Lett., 2009


  Loading...