![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Hatem Hadda
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j17]Mohamed Karim Hajji, Hatem Hadda, Najoua Dridi:
Makespan Minimization for the Two-Stage Hybrid Flow Shop Problem with Dedicated Machines: A Comprehensive Study of Exact and Heuristic Approaches. Comput. 11(7): 137 (2023) - [j16]Meriem Mejri, Sana Bouajaja, Hatem Hadda, Najoua Dridi:
New models for the two-sided assembly line balancing problem. Int. J. Adv. Oper. Manag. 15(3): 207-223 (2023) - [j15]Hatem Hadda
, Mhamed Abdessalem:
New characterizations for the identical coupled tasks scheduling problem. RAIRO Oper. Res. 57(2): 325-332 (2023) - 2021
- [j14]Khaoula Ben Abdellafou
, Hatem Hadda, Ouajdi Korbaa
:
Heuristic algorithms for scheduling intrees on m machines with non-availability constraints. Oper. Res. 21(1): 55-71 (2021) - [c2]Asma Fekih, Hatem Hadda, Imed Kacem
, Atidel B. Hadj-Alouane:
A Random-key based genetic algorithm for the flexible job-shop scheduling minimizing total completion time. DeSE 2021: 443-447
2010 – 2019
- 2018
- [j13]Hatem Hadda, Najoua Dridi, Mohamed Karim Hajji:
On the optimality conditions of the two-machine flow shop problem. Eur. J. Oper. Res. 266(2): 426-435 (2018) - 2016
- [c1]Khaoula Ben Abdellafou, Hatem Hadda, Ouajdi Korbaa
:
Heuristic for Scheduling Intrees on m Machines with Non-availability Constraints. ISDA 2016: 384-393 - 2015
- [j12]Mohamed Karim Hajji, Hatem Hadda
, Najoua Dridi:
The two-stage hybrid flow shop problem with dedicated machines under release dates and delivery times. Int. J. Adv. Oper. Manag. 7(4): 300-316 (2015) - [j11]Hatem Hadda
, Mohamed Karim Hajji, Najoua Dridi:
On the two-stage hybrid flow shop with dedicated machines. RAIRO Oper. Res. 49(4): 795-804 (2015) - 2014
- [j10]Hatem Hadda
, Najoua Dridi, Sonia Hajri-Gabouj:
The Two-stage Assembly Flow Shop Scheduling with an Availability Constraint: Worst Case Analysis. J. Math. Model. Algorithms Oper. Res. 13(3): 233-245 (2014) - [j9]Hatem Hadda
:
A PTAS for a Particular Case of the Two-machine Flow Shop with Limited Machine Availability. J. Math. Model. Algorithms Oper. Res. 13(4): 511-522 (2014) - [j8]Hatem Hadda
, Najoua Dridi, Sonia Hajri-Gabouj:
Exact resolution of the two-stage hybrid flow shop with dedicated machines. Optim. Lett. 8(8): 2329-2339 (2014) - 2013
- [j7]Hatem Hadda
:
A note on "A heuristic method for two-stage hybrid flow shop with dedicated machines". Comput. Oper. Res. 40(10): 2283 (2013) - 2012
- [j6]Hatem Hadda
:
A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints. Optim. Lett. 6(3): 559-569 (2012) - [j5]Hatem Hadda
, Najoua Dridi, Sonia Hajri-Gabouj:
A note on the two-stage hybrid flow shop problem with dedicated machines. Optim. Lett. 6(8): 1731-1736 (2012) - 2010
- [j4]Hatem Hadda
, Najoua Dridi, Sonia Hajri-Gabouj:
An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs. 4OR 8(1): 87-99 (2010) - [j3]Hatem Hadda
:
An improved algorithm for the two machine flow shop problem with several availability constraints. 4OR 8(3): 271-280 (2010)
2000 – 2009
- 2009
- [j2]Hatem Hadda
:
A (4/3)-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints. Optim. Lett. 3(4): 583-592 (2009) - [j1]Najoua Dridi, Hatem Hadda
, Sonia Hajri-Gabouj:
Méthode heuristique pour le problème de flow shop hybride avec machines dédiées. RAIRO Oper. Res. 43(4): 421-436 (2009)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint