default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNajoua Dridi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]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)- [j12]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) - 2022
- [c3]Meriem Mejri, Sana Bouajaja, Najoua Dridi:
Multi-Manned Two-Sided Assembly Line Worker Assignment and Balancing Problem. ICCAD 2022: 1-6 - 2021
- [c2]Meriem Mejri, Sana Bouajaja, Najoua Dridi:
Two Novel Mathematical Formulations for solving Two-Sided Assembly Line Balancing Problem. ICCAD 2021: 1-6
2010 – 2019
- 2018
- [j11]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) - 2017
- [j10]Sana Bouajaja, Najoua Dridi:
A survey on human resource allocation problem and its applications. Oper. Res. 17(2): 339-369 (2017) - 2015
- [j9]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) - [j8]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) - [c1]Sana Bouajaja, Najoua Dridi:
Research on the optimal parameters of ACO algorithm for a human resource allocation problem. SOLI 2015: 60-65 - 2014
- [j7]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) - [j6]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) - [j5]Mohamed Ali Aloulou, Afef Bouzaiene, Najoua Dridi, Daniel Vanderpooten:
A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size. J. Sched. 17(1): 17-29 (2014) - 2012
- [j4]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
- [j3]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) - [j2]Afef Bouzaiene, Najoua Dridi, Mohamed Ali Aloulou, Daniel Vanderpooten:
A bicriteria flow-shop scheduling problem with two serial batching machines. Electron. Notes Discret. Math. 36: 1177-1184 (2010)
2000 – 2009
- 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
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-10-07 22:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
