default search action
Bassem Jarboui
Person information
- affiliation: University of Sfax
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j48]Bassem Jarboui, Malek Masmoudi
, Mansour Eddaly:
Epsilon Oscillation Algorithm for the bi-objective green identical parallel machine scheduling problem. Comput. Oper. Res. 170: 106754 (2024) - [j47]Bassem Jarboui, Mansour Eddaly
A branch-and-bound approach to the no-idle flowshop scheduling problem. Discret. Appl. Math. 347: 297-310 (2024) - [j46]Yassine Adouani
Iterative integer linear programming-based heuristic for solving the multiple-choice knapsack problem with setups. Expert Syst. Appl. 242: 122835 (2024) - [j45]Malek Masmoudi
LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup. Int. Trans. Oper. Res. 31(3): 1890-1916 (2024) - 2023
- [j44]Wahiba Jomaa, Mansour Eddaly, Bassem Jarboui:
Mixed integer linear programming formulations for the permutation flow shop scheduling problem with preventive maintenance activities. Int. J. Math. Oper. Res. 25(2): 139-160 (2023) - [j43]Malek Masmoudi, Bassem Jarboui, Rahma Borchani:
Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits. Optim. Lett. 17(9): 2135-2167 (2023) - [j42]Rustam Mussabayev, Nenad Mladenovic, Bassem Jarboui, Ravil Mussabayev
How to Use K-means for Big Data Clustering? Pattern Recognit. 137: 109269 (2023) - 2022
- [j41]Yassine Adouani
A matheuristic for the 0-1 generalized quadratic multiple knapsack problem. Optim. Lett. 16(1): 37-58 (2022) - [j40]Saber Ibrahim
A General Variable Neighborhood Search approach based on a p-median model for cellular manufacturing problems. Optim. Lett. 16(1): 137-151 (2022) - [j39]Souhir Elleuch
Variable neighborhood programming for symbolic regression. Optim. Lett. 16(1): 191-210 (2022) - [j38]Souhir Elleuch
Preventive maintenance planning of railway infrastructure by reduced variable neighborhood programming. Optim. Lett. 16(1): 237-253 (2022) - [i1]Rustam Mussabayev, Nenad Mladenovic, Bassem Jarboui, Ravil Mussabayev
Big-means: Less is More for K-means Clustering. CoRR abs/2204.07485 (2022) - 2021
- [j37]Nejah Ben Mabrouk, Bassem Jarboui
Solving the joint production distribution problem by the variable neighbourhood search algorithm. Int. J. Math. Oper. Res. 18(4): 484-502 (2021) - [j36]Wahiba Jomaa, Mansour Eddaly
Variable neighborhood search algorithms for the permutation flowshop scheduling problem with the preventive maintenance. Oper. Res. 21(4): 2525-2542 (2021) - [c6]Souhir Elleuch, Bassem Jarboui:
Analysis of Six Different GP-Tree Neighborhood Structures. ISDA 2021: 1237-1249 - 2020
- [j35]Noura Smiti, Mohamed Mahjoub Dhiaf
Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem. Int. Trans. Oper. Res. 27(1): 651-664 (2020)
2010 – 2019
- 2019
- [j34]Houda Derbel, Bassem Jarboui
A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem. Ann. Oper. Res. 272(1-2): 243-272 (2019) - [c5]Rahma Borchani, Malek Masmoudi, Bassem Jarboui
Hybrid Genetic Algorithm for Home Healthcare routing and scheduling problem. CoDIT 2019: 1900-1904 - 2018
- [j33]Manel Belkhamsa, Bassem Jarboui
Two metaheuristics for solving no-wait operating room surgery scheduling problem under various resource constraints. Comput. Ind. Eng. 126: 494-506 (2018) - [c4]Souhir Elleuch
Variable Neighborhood Programming For Evolving Discriminent Functions With Dynamic Thresholds. ICMLC 2018: 263-268 - [c3]Yassine Adouani
A Variable Neighborhood Search with Integer Programming for the Zero-One Multiple-Choice Knapsack Problem with Setup. ICVNS 2018: 152-166 - [c2]Manel Kammoun, Houda Derbel, Bassem Jarboui
A General Variable Neighborhood Search with Mixed VND for the multi-Vehicle multi-Covering Tour Problem. ICVNS 2018: 259-273 - [c1]Manel Kammoun, Houda Derbel, Bassem Jarboui
A GVNS Algorithm to Solve VRP with Optional Visits. ICVNS 2018: 303-314 - 2017
- [j32]Abraham Duarte, Nenad Mladenovic
Special issue on Variable neighborhood search methods in business and engineering. Comput. Oper. Res. 78: 382-384 (2017) - [j31]Raca Todosijevic
A general variable neighborhood search for the swap-body vehicle routing problem. Comput. Oper. Res. 78: 468-479 (2017) - [j30]Samia Hasni, Said Toumi
GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem. Electron. Notes Discret. Math. 58: 71-78 (2017) - [j29]Souhir Elleuch
New VNP for automatic programming. Electron. Notes Discret. Math. 58: 191-198 (2017) - [j28]Marwa Amous, Said Toumi
A variable neighborhood search algorithm for the capacitated vehicle routing problem. Electron. Notes Discret. Math. 58: 231-238 (2017) - [j27]Said Toumi, Bassem Jarboui
Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion. Int. J. Math. Oper. Res. 10(1): 34-48 (2017) - [j26]Manel Kammoun, Houda Derbel, Mostapha Ratli, Bassem Jarboui
An integration of mixed VND and VNS: the case of the multivehicle covering tour problem. Int. Trans. Oper. Res. 24(3): 663-679 (2017) - 2016
- [j25]Mansour Eddaly
Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem. J. Comput. Des. Eng. 3(4): 295-311 (2016) - 2015
- [j24]Rita Macedo
Skewed general variable neighborhood search for the location routing scheduling problem. Comput. Oper. Res. 61: 143-152 (2015) - [j23]Bassem Jarboui
3rd International Conference on Variable Neighborhood Search (VNS'14). Electron. Notes Discret. Math. 47: 1-4 (2015) - [j22]Said Toumi
0 - 1 Quadratic Knapsack Problem solved with VNS algorithm. Electron. Notes Discret. Math. 47: 269-276 (2015) - [j21]Mohamed Cheikh, Mustapha Ratli, Omar Mkaouar, Bassem Jarboui
A variable neighborhood search algorithm for the vehicle routing problem with multiple trips. Electron. Notes Discret. Math. 47: 277-284 (2015) - [j20]Manel Kammoun, Houda Derbel, Mustapha Ratli, Bassem Jarboui
A variable neighborhood search for solving the multi-vehicle covering tour problem. Electron. Notes Discret. Math. 47: 285-292 (2015) - 2014
- [j19]Abdelkarim Elloumi, Hichem Kamoun, Bassem Jarboui
The classroom assignment problem: Complexity, size reduction and heuristics. Appl. Soft Comput. 14: 677-686 (2014) - [j18]Anis Mjirda, Bassem Jarboui
A two phase variable neighborhood search for the multi-product inventory routing problem. Comput. Oper. Res. 52: 291-299 (2014) - 2013
- [j17]Bassem Jarboui
Variable neighborhood search for location routing. Comput. Oper. Res. 40(1): 47-57 (2013) - 2012
- [j16]Hanen Akrout, Bassem Jarboui
A GRASP based on DE to solve single machine scheduling problem with SDST. Comput. Optim. Appl. 51(1): 411-435 (2012) - [j15]Anis Mjirda, Bassem Jarboui
A variable neighborhood search for the multi-product inventory routing problem. Electron. Notes Discret. Math. 39: 91-98 (2012) - [j14]Houda Derbel, Bassem Jarboui
Genetic algorithm with iterated local search for solving a location-routing problem. Expert Syst. Appl. 39(3): 2865-2871 (2012) - [j13]Noura Beji, Bassem Jarboui
A differential evolution algorithm to solve redundancy allocation problems. Int. Trans. Oper. Res. 19(6): 809-824 (2012) - 2011
- [j12]Radhouan Bouabda, Bassem Jarboui
A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times. Comput. Oper. Res. 38(1): 387-393 (2011) - [j11]Nizar Hachicha, Bassem Jarboui
A fuzzy logic control using a differential evolution algorithm aimed at modelling the financial market dynamics. Inf. Sci. 181(1): 79-91 (2011) - 2010
- [j10]Bassem Jarboui
A new destructive bounding scheme for the bin packing problem. Ann. Oper. Res. 179(1): 187-202 (2010) - [j9]Makram Zaidi
Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines. Electron. Notes Discret. Math. 36: 543-550 (2010) - [j8]Mohamed Cheikh, Bassem Jarboui
A genetic algorithms to solve the bicriteria shortest path problem. Electron. Notes Discret. Math. 36: 851-858 (2010) - [j7]Houda Derbel, Bassem Jarboui
An Iterated Local Search for Solving A Location-Routing Problem. Electron. Notes Discret. Math. 36: 875-882 (2010) - [j6]Noura Beji, Bassem Jarboui
A Hybrid Particle Swarm Optimization Algorithm for the Redundancy Allocation Problem. J. Comput. Sci. 1(3): 159-167 (2010)
2000 – 2009
- 2009
- [j5]Bassem Jarboui
An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Comput. Oper. Res. 36(9): 2638-2646 (2009) - [j4]N. Damak, Bassem Jarboui
Differential evolution for solving multi-mode resource-constrained project scheduling problems. Comput. Oper. Res. 36(9): 2653-2659 (2009) - [p1]Mansour Eddaly, Bassem Jarboui
An Estimation of Distribution Algorithm for Flowshop Scheduling with Limited Buffers. Natural Intelligence for Scheduling, Planning and Packing Problems 2009: 89-110 - 2008
- [j3]Bassem Jarboui
A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. Appl. Math. Comput. 195(1): 299-308 (2008) - [j2]Bassem Jarboui
A combinatorial particle swarm optimisation for solving permutation flowshop problems. Comput. Ind. Eng. 54(3): 526-538 (2008) - 2007
- [j1]Bassem Jarboui
Combinatorial particle swarm optimization (CPSO) for partitional clustering problem. Appl. Math. Comput. 192(2): 337-345 (2007)
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-08-03 21:12 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: