Bassem Jarboui

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 36

Top Topics

Variable Neighborhood Search

Top Venues

Electron. Notes Discret. Math.

Comput. Oper. Res.

Int. J. Math. Oper. Res.

Publications

Bassem Jarboui, Mansour Eddaly
A branch-and-bound approach to the no-idle flowshop scheduling problem. Discret. Appl. Math. 347 (2024)
Bassem Jarboui, Malek Masmoudi, Mansour Eddaly
Epsilon Oscillation Algorithm for the bi-objective green identical parallel machine scheduling problem. Comput. Oper. Res. 170 (2024)
Malek Masmoudi, Yassine Adouani, Bassem Jarboui
LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup. Int. Trans. Oper. Res. 31 (3) (2024)
Yassine Adouani, Malek Masmoudi, Fethi Jarray, Bassem Jarboui
Iterative integer linear programming-based heuristic for solving the multiple-choice knapsack problem with setups. Expert Syst. Appl. 242 (2024)
Rustam Mussabayev, Nenad Mladenovic, Bassem Jarboui, Ravil Mussabayev
How to Use K-means for Big Data Clustering? Pattern Recognit. 137 (2023)
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) (2023)
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) (2023)
Rustam Mussabayev, Nenad Mladenovic, Bassem Jarboui, Ravil Mussabayev
Big-means: Less is More for K-means Clustering. CoRR (2022)
Souhir Elleuch, Bassem Jarboui, Nenad Mladenovic
Preventive maintenance planning of railway infrastructure by reduced variable neighborhood programming. Optim. Lett. 16 (1) (2022)
Saber Ibrahim, Bassem Jarboui
A General Variable Neighborhood Search approach based on a p-median model for cellular manufacturing problems. Optim. Lett. 16 (1) (2022)
Yassine Adouani, Bassem Jarboui, Malek Masmoudi
A matheuristic for the 0-1 generalized quadratic multiple knapsack problem. Optim. Lett. 16 (1) (2022)
Souhir Elleuch, Bassem Jarboui, Nenad Mladenovic, Jun Pei
Variable neighborhood programming for symbolic regression. Optim. Lett. 16 (1) (2022)
Nejah Ben Mabrouk, Bassem Jarboui, Mansour Eddaly
Solving the joint production distribution problem by the variable neighbourhood search algorithm. Int. J. Math. Oper. Res. 18 (4) (2021)
Souhir Elleuch, Bassem Jarboui
Analysis of Six Different GP-Tree Neighborhood Structures. ISDA (2021)
Wahiba Jomaa, Mansour Eddaly, Bassem Jarboui
Variable neighborhood search algorithms for the permutation flowshop scheduling problem with the preventive maintenance. Oper. Res. 21 (4) (2021)
Noura Smiti, Mohamed Mahjoub Dhiaf, Bassem Jarboui, Saïd Hanafi
Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem. Int. Trans. Oper. Res. 27 (1) (2020)
Houda Derbel, Bassem Jarboui, Rim Bhiri
A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem. Ann. Oper. Res. 272 (1-2) (2019)
Rahma Borchani, Malek Masmoudi, Bassem Jarboui
Hybrid Genetic Algorithm for Home Healthcare routing and scheduling problem. CoDIT (2019)
Souhir Elleuch, Bassem Jarboui
Variable Neighborhood Programming For Evolving Discriminent Functions With Dynamic Thresholds. ICMLC (2018)
Manel Kammoun, Houda Derbel, Bassem Jarboui
A General Variable Neighborhood Search with Mixed VND for the multi-Vehicle multi-Covering Tour Problem. ICVNS (2018)
Yassine Adouani, Bassem Jarboui, Malek Masmoudi
A Variable Neighborhood Search with Integer Programming for the Zero-One Multiple-Choice Knapsack Problem with Setup. ICVNS (2018)
Manel Kammoun, Houda Derbel, Bassem Jarboui
A GVNS Algorithm to Solve VRP with Optional Visits. ICVNS (2018)
Manel Belkhamsa, Bassem Jarboui, Malek Masmoudi
Two metaheuristics for solving no-wait operating room surgery scheduling problem under various resource constraints. Comput. Ind. Eng. 126 (2018)
Marwa Amous, Said Toumi, Bassem Jarboui, Mansour Eddaly
A variable neighborhood search algorithm for the capacitated vehicle routing problem. Electron. Notes Discret. Math. 58 (2017)
Abraham Duarte, Nenad Mladenovic, Bassem Jarboui
Special issue on Variable neighborhood search methods in business and engineering. Comput. Oper. Res. 78 (2017)
Raca Todosijevic, Saïd Hanafi, Dragan Urosevic, Bassem Jarboui, Bernard Gendron
A general variable neighborhood search for the swap-body vehicle routing problem. Comput. Oper. Res. 78 (2017)
Souhir Elleuch, Pierre Hansen, Bassem Jarboui, Nenad Mladenovic
New VNP for automatic programming. Electron. Notes Discret. Math. 58 (2017)
Said Toumi, Bassem Jarboui, Mansour Eddaly, Abdelwaheb Rebaï
Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion. Int. J. Math. Oper. Res. 10 (1) (2017)
Samia Hasni, Said Toumi, Bassem Jarboui, Anis Mjirda
GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem. Electron. Notes Discret. Math. 58 (2017)
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) (2017)
Mansour Eddaly, Bassem Jarboui, Patrick Siarry
Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem. J. Comput. Des. Eng. 3 (4) (2016)
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 (2015)
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 (2015)
Said Toumi, Mohamed Cheikh, Bassem Jarboui
0 - 1 Quadratic Knapsack Problem solved with VNS algorithm. Electron. Notes Discret. Math. 47 (2015)
Rita Macedo, Cláudio Alves, Saïd Hanafi, Bassem Jarboui, Nenad Mladenovic, Bruna Ramos, José M. Valério de Carvalho
Skewed general variable neighborhood search for the location routing scheduling problem. Comput. Oper. Res. 61 (2015)
Bassem Jarboui, Angelo Sifaleras, Abdelwaheb Rebaï
3rd International Conference on Variable Neighborhood Search (VNS'14). Electron. Notes Discret. Math. 47 (2015)
Anis Mjirda, Bassem Jarboui, Rita Macedo, Saïd Hanafi, Nenad Mladenovic
A two phase variable neighborhood search for the multi-product inventory routing problem. Comput. Oper. Res. 52 (2014)
Abdelkarim Elloumi, Hichem Kamoun, Bassem Jarboui, Abdelaziz Dammak
The classroom assignment problem: Complexity, size reduction and heuristics. Appl. Soft Comput. 14 (2014)
Bassem Jarboui, Houda Derbel, Saïd Hanafi, Nenad Mladenovic
Variable neighborhood search for location routing. Comput. Oper. Res. 40 (1) (2013)
Anis Mjirda, Bassem Jarboui, Rita Macedo, Saïd Hanafi
A variable neighborhood search for the multi-product inventory routing problem. Electron. Notes Discret. Math. 39 (2012)
Noura Beji, Bassem Jarboui, Patrick Siarry, Habib Chabchoub
A differential evolution algorithm to solve redundancy allocation problems. Int. Trans. Oper. Res. 19 (6) (2012)
Hanen Akrout, Bassem Jarboui, Patrick Siarry, Abdelwaheb Rebaï
A GRASP based on DE to solve single machine scheduling problem with SDST. Comput. Optim. Appl. 51 (1) (2012)
Houda Derbel, Bassem Jarboui, Saïd Hanafi, Habib Chabchoub
Genetic algorithm with iterated local search for solving a location-routing problem. Expert Syst. Appl. 39 (3) (2012)
Nizar Hachicha, Bassem Jarboui, Patrick Siarry
A fuzzy logic control using a differential evolution algorithm aimed at modelling the financial market dynamics. Inf. Sci. 181 (1) (2011)
Radhouan Bouabda, Bassem Jarboui, Mansour Eddaly, Abdelwaheb Rebaï
A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times. Comput. Oper. Res. 38 (1) (2011)
Noura Beji, Bassem Jarboui, Mansour Eddaly, Habib Chabchoub
A Hybrid Particle Swarm Optimization Algorithm for the Redundancy Allocation Problem. J. Comput. Sci. 1 (3) (2010)
Makram Zaidi, Bassem Jarboui, Imed Kacem, Taïcir Loukil
Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines. Electron. Notes Discret. Math. 36 (2010)
Bassem Jarboui, Saber Ibrahim, Abdelwaheb Rebaï
A new destructive bounding scheme for the bin packing problem. Ann. Oper. Res. 179 (1) (2010)
Mohamed Cheikh, Bassem Jarboui, Taïcir Loukil
A genetic algorithms to solve the bicriteria shortest path problem. Electron. Notes Discret. Math. 36 (2010)
Houda Derbel, Bassem Jarboui, Saïd Hanafi, Habib Chabchoub
An Iterated Local Search for Solving A Location-Routing Problem. Electron. Notes Discret. Math. 36 (2010)
N. Damak, Bassem Jarboui, Patrick Siarry, Taïcir Loukil
Differential evolution for solving multi-mode resource-constrained project scheduling problems. Comput. Oper. Res. 36 (9) (2009)
Bassem Jarboui, Mansour Eddaly, Patrick Siarry
An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Comput. Oper. Res. 36 (9) (2009)
Bassem Jarboui, Saber Ibrahim, Patrick Siarry, Abdelwaheb Rebaï
A combinatorial particle swarm optimisation for solving permutation flowshop problems. Comput. Ind. Eng. 54 (3) (2008)
Bassem Jarboui, N. Damak, Patrick Siarry, Ahmed Riadh Rebai
A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. Appl. Math. Comput. 195 (1) (2008)
Bassem Jarboui, Mohamed Cheikh, Patrick Siarry, Ahmed Riadh Rebai
Combinatorial particle swarm optimization (CPSO) for partitional clustering problem. Appl. Math. Comput. 192 (2) (2007)