default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTalel Ladhari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j18]Ameen Banjar, Mahdi Jemmali
, Loai Kayed B. Melhim, Wadii Boulila, Talel Ladhari, Akram Y. Sarhan:
Intelligent Scheduling Algorithms for the Enhancement of Drone-Based Innovative Logistic Supply Chain Systems. IEEE Access 11: 102418-102429 (2023)- [j17]Ali Balma, Mehdi Mrad, Talel Ladhari:
Tight lower bounds for the Traveling Salesman Problem with draft limits. Comput. Oper. Res. 154: 106196 (2023) - 2020
- [j16]Mohamed Ali Rakrouki, Anis Kooli, Sabrine Chalghoumi, Talel Ladhari:
A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates. Oper. Res. 20(1): 21-35 (2020)
2010 – 2019
- 2019
- [j15]Mehdi Mrad, Sabrine Chalghoumi, Talel Ladhari, Anis Gharbi:
Enhanced lower bounds and exact procedures for total completion time minimization in a two-machine permutation flowshop with release dates. Int. Trans. Oper. Res. 26(6): 2432-2449 (2019) - 2018
- [j14]Mohamed Labidi, Anis Kooli, Talel Ladhari, Anis Gharbi, Umar S. Suryahatmaja:
A Computational Study of the Two-Machine No-Wait Flow Shop Scheduling Problem Subject to Unequal Release Dates and Non-Availability Constraints. IEEE Access 6: 16294-16304 (2018) - [j13]Nouri Nouha, Talel Ladhari:
Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking. Ann. Oper. Res. 267(1-2): 413-430 (2018) - [j12]Ali Balma, Safa Ben Salem, Mehdi Mrad, Talel Ladhari:
Strong multi-commodity flow formulations for the asymmetric traveling salesman problem. Eur. J. Oper. Res. 271(1): 72-79 (2018) - [j11]Hadhami Kaabi, Khaled Jabeur, Talel Ladhari:
A Genetic Algorithm-Based Classification Approach for Multicriteria ABC Analysis. Int. J. Inf. Technol. Decis. Mak. 17(6): 1805-1837 (2018) - 2017
- [j10]Mehdi Mrad, Ali Balma, Fatma Moalla, Talel Ladhari:
Nodes Migration Scheduling of Access Networks. IEEE Trans. Netw. Serv. Manag. 14(1): 77-90 (2017) - 2016
- [j9]Nouri Nouha, Talel Ladhari:
An Efficient Iterated Greedy Algorithm for the Makespan Blocking Flow Shop Scheduling Problem. Polibits 53: 91-95 (2016) - [c15]Nouri Nouha, Talel Ladhari:
Total Tardiness Minimization in a Flow Shop with Blocking Using an Iterated Greedy Algorithm. CSOC (1) 2016: 93-102 - [c14]Hedi Cherif, Talel Ladhari:
Multiple Criteria Inventory Classification Approach Based on Differential Evolution and Electre III. HIS 2016: 68-77 - [c13]Hedi Cherif, Talel Ladhari:
A New Hybrid Multi-criteria ABC Inventory Classification Model Based on Differential Evolution and Topsis. HIS 2016: 78-87 - [c12]Hedi Cherif, Talel Ladhari:
A Novel Multi-criteria Inventory Classification Approach: Artificial Bee Colony Algorithm with VIKOR Method. ISCIS 2016: 63-71 - 2015
- [c11]Nouri Nouha, Talel Ladhari:
A Particle Swarm Optimization Metaheuristic for the Blocking Flow Shop Scheduling Problem: Total Tardiness Minimization. EUMAS/AT 2015: 145-153 - [c10]Nouri Nouha, Talel Ladhari:
Minimizing Regular Objectives for Blocking Permutation Flow Shop Scheduling: Heuristic Approaches. GECCO 2015: 441-448 - [c9]Lamia Trabelsi, Talel Ladhari:
A proposal four-based-view framework to evaluate optimization tools. ICSC 2015: 284-289 - [c8]Samia Kouki, Mohamed Jemni, Talel Ladhari:
A parallel algorithm for solving the PFSP with load balancing on the grid: An empirical study. ICTA 2015: 1-6 - 2014
- [c7]Hadhami Kaabi, Khaled Jabeur, Talel Ladhari:
Genetic Algorithm to infer criteria weights for Multicriteria Inventory Classification. CoDIT 2014: 276-281 - 2013
- [j8]Anis Gharbi, Talel Ladhari, Mohamed Kais Msakni, Mehdi Serairi:
The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies. Eur. J. Oper. Res. 231(1): 69-78 (2013) - [c6]Samia Kouki, Mohamed Jemni, Talel Ladhari:
Scalable Distributed Branch and Bound for the Permutation Flow Shop Problem. 3PGCIC 2013: 503-508 - [c5]Samia Kouki, Mohamed Jemni, Talel Ladhari:
A distributed algorithm for the Permutation Flow Shop Problem - An empirical analysis. PARCO 2013: 451-460 - 2012
- [j7]Mohamed Ali Rakrouki, Talel Ladhari, Vincent T'kindt:
Coupling Genetic Local Search and Recovering Beam Search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates. Comput. Oper. Res. 39(6): 1257-1264 (2012) - [j6]Talel Ladhari, Mohamed Kais Msakni, Ali Allahverdi:
Minimizing the total completion time in a two-machine flowshop with sequence-independent setup times. J. Oper. Res. Soc. 63(4): 445-459 (2012) - [c4]Samia Kouki, Mohamed Jemni, Talel Ladhari:
A Load Balanced Distributed Algorithm to Solve the Permutation Flow Shop Problem Using the Grid. CSE 2012: 146-153 - 2010
- [j5]Anis Gharbi, Talel Ladhari, Mohamed Kais Msakni, Mehdi Serairi:
Polynomial Lower Bounds for the Two-Machine Flowshop Problem with Sequence-Independent Setup Times. Electron. Notes Discret. Math. 36: 1089-1096 (2010) - [c3]Samia Kouki, Mohamed Jemni, Talel Ladhari:
Deployment of Solving Permutation Flow Shop Scheduling Problem on the Grid. FGIT-GDC/CA 2010: 95-104 - [c2]Samia Kouki, Talel Ladhari, Mohamed Jemni:
A Parallel Distributed Algorithm for the Permutation Flow Shop Scheduling Problem. ICA3PP (2) 2010: 328-337 - [c1]Samia Kouki, Mohamed Jemni, Talel Ladhari:
Design of parallel distributed algorithm for the Permutation Flow Shop Problem. NOTERE 2010: 65-72
2000 – 2009
- 2007
- [j4]Mohamed Haouari, Talel Ladhari:
Minimizing maximum lateness in a flow shop subject to release dates. J. Oper. Res. Soc. 58(1): 62-72 (2007) - 2005
- [j3]Talel Ladhari, Mohamed Haouari:
A computational study of the permutation flow shop problem based on a tight lower bound. Comput. Oper. Res. 32: 1831-1847 (2005) - 2003
- [j2]Mohamed Haouari, Talel Ladhari:
A branch-and-bound-based local search method for the flow shop problem. J. Oper. Res. Soc. 54(10): 1076-1084 (2003) - 2000
- [j1]Mohamed Haouari, Talel Ladhari:
Minimising maximum lateness in a two-machine flowshop. J. Oper. Res. Soc. 51(9): 1100-1106 (2000)
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-04-25 05:53 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:
