default search action
Anis Gharbi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j25]Roua Ben Ammar
, Anis Gharbi
Soccer Match Algorithm for Global Optimization: A Contender Metaheuristic. IEEE Access 12: 93924-93945 (2024) - [j24]Khaled Bamatraf
Variable Neighborhood Search for Minimizing the Makespan in a Uniform Parallel Machine Scheduling. Syst. 12(6): 221 (2024) - 2023
- [j23]Umar S. Suryahatmaja
The K Critical Path Sets to Protect in Interdiction Networks Under Limited Defensive Resources. IEEE Trans. Netw. Serv. Manag. 20(4): 5141-5154 (2023) - 2022
- [j22]Mohamed Naceur Azaiez
Two-stage no-wait hybrid flow shop with inter-stage flexibility for operating room scheduling. Comput. Ind. Eng. 168: 108040 (2022) - 2021
- [c2]Mohamed Naceur Azaiez
Two-stage no-wait hybrid flow shop scheduling with inter-stage flexibility: A mathematical model. ICNSC 2021: 1-5 - 2020
- [j21]Mehdi Mrad
A Column Generation-Based Lower Bound for the Minimum Sum Coloring Problem. IEEE Access 8: 57891-57904 (2020)
2010 – 2019
- 2019
- [j20]Mehdi Mrad
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
- [j19]Mohamed Labidi
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) - 2017
- [j18]Lotfi Hidri
New Efficient Lower Bound for the Hybrid Flow Shop Scheduling Problem With Multiprocessor Tasks. IEEE Access 5: 6121-6133 (2017) - [c1]Anis Gharbi, Mohamed-Aly Louly, Mohamed Naceur Azaiez:
Physician scheduling using goal programming-an application to a large hospital in Saudi Arabia. CoDIT 2017: 922-925 - 2016
- [j17]Mehdi Mrad
An optimization-based heuristic for the machine reassignment problem. Ann. Oper. Res. 242(1): 115-132 (2016) - 2014
- [j16]Anis Gharbi
The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures. J. Appl. Math. 2014: 273567:1-273567:14 (2014) - 2013
- [j15]Anis Gharbi, Talel Ladhari
The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies. Eur. J. Oper. Res. 231(1): 69-78 (2013) - 2010
- [j14]Anis Gharbi, Mohamed Labidi:
Jackson's semi-preemptive scheduling on a single machine. Comput. Oper. Res. 37(12): 2082-2088 (2010) - [j13]Anis Gharbi, Mohamed Naceur Azaiez
Minimizing Expected Attacking Cost in Networks. Electron. Notes Discret. Math. 36: 947-954 (2010) - [j12]Anis Gharbi, Mohamed Labidi:
Extending the Single Machine-Based Relaxation Scheme for the Job Shop Scheduling Problem. Electron. Notes Discret. Math. 36: 1057-1064 (2010) - [j11]Anis Gharbi, Talel Ladhari
Polynomial Lower Bounds for the Two-Machine Flowshop Problem with Sequence-Independent Setup Times. Electron. Notes Discret. Math. 36: 1089-1096 (2010)
2000 – 2009
- 2009
- [j10]F. I. Dehayem Nodem, Jean-Pierre Kenné
Hierarchical decision making in production and repair/replacement planning with imperfect repairs under uncertainties. Eur. J. Oper. Res. 198(1): 173-189 (2009) - 2008
- [j9]Lotfi Hidri, Anis Gharbi, Mohamed Haouari
Energetic reasoning revisited: application to parallel machine scheduling. J. Sched. 11(4): 239-252 (2008) - 2007
- [j8]Anis Gharbi, Mohamed Haouari
An approximate decomposition algorithm for scheduling on parallel machines with heads and tails. Comput. Oper. Res. 34(3): 868-883 (2007) - [j7]Jean-Pierre Kenné
Age-dependent production planning and maintenance strategies in unreliable manufacturing systems with lost sale. Eur. J. Oper. Res. 178(2): 408-420 (2007) - 2006
- [j6]Mohamed Haouari
Tight bounds for the identical parallel machine scheduling problem. Int. Trans. Oper. Res. 13(6): 529-548 (2006) - [j5]Mohamed Haouari
Optimal Scheduling of a Two-stage Hybrid Flow Shop. Math. Methods Oper. Res. 64(1): 107-124 (2006) - 2005
- [j4]Anis Gharbi, Mohamed Haouari
Optimal parallel machines scheduling with availability constraints. Discret. Appl. Math. 148(1): 63-87 (2005) - [j3]Mohamed Haouari
Fast lifting procedures for the bin packing problem. Discret. Optim. 2(3): 201-218 (2005) - 2004
- [j2]Mohamed Haouari, Anis Gharbi:
Lower Bounds for Scheduling on Identical Parallel Machines with Heads and Tails. Ann. Oper. Res. 129(1-4): 187-204 (2004) - 2003
- [j1]Mohamed Haouari
An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines. Oper. Res. Lett. 31(1): 49-52 (2003)
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 2025-01-20 22:56 CET 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: