الرئيسية › دليل الباحثين › Bassem Jarboui
Bassem Jarboui
الانتماء : Centre National de la Recherche Scientifique · Laboratoire d'Automatique, de Mécanique et d'Informatique Industrielles et Humaines · Université Polytechnique Hauts-de-France
- 63منشورات (انتماء تونسي)
- 146مجموع المنشورات
- 2446الاستشهادات
- 25مؤشر h
الملف البحثي
لدى Bassem Jarboui 63 منشور(ات) مفهرسة (2007–2025). تُنشر أعماله أساسًا في «Electronic Notes in Discrete Mathematics»، «Computers & Operations Research» و«HAL». أكثر مقالاته استشهادًا هو «A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems» (2007)، وقد استُشهد به 308 مرة. 6 من هذه المنشورات تعود إلى آخر ثلاث سنوات من النشاط. شارك في تأليف أعماله 12 باحثًا على الأقل، منهم باحثون من مؤسسات في فرنسا، السعودية، الإمارات.
هل هذا أنت؟ عرّف بأبحاثك
أنشئ ملفك على DzCademia مجانًا وأضف مقالاتك: ستظهر بسهولة أكبر على Google وفي مساعدي الذكاء الاصطناعي مثل ChatGPT، فيقرؤها ويستشهد بها عدد أكبر من الناس.
إنشاء ملفي المجاني إضافة منشوراتيمجالات البحث
- Scheduling and Optimization Algorithms
- Metaheuristic Optimization Algorithms Research
- Vehicle Routing Optimization Methods
- Advanced Manufacturing and Logistics Optimization
- Healthcare Operations and Scheduling Optimization
المنشورات (63)
- Generalized variable neighborhood search algorithm for vehicle routing problem with time windows and synchronization
- Hybrid Hungarian Algorithm and GVNS metaheuristic for the patient admission scheduling problem
- A Hybrid Meta-Heuristic to Solve Flexible Job Shop Scheduling Problem
- Skewed general variable neighborhood search to solve the multi-compartment vehicle routing problem
- Metaheuristics for Machine Learning
- Iterative integer linear programming-based heuristic for solving the multiple-choice knapsack problem with setups
- Solving the joint production distribution problem by the variable neighbourhood search algorithm
- Green Transportation and New Advances in Vehicle Routing Problems
- Modeling and Optimization in Green Logistics
- A Skewed General Variable Neighborhood Search Approach for Solving the Battery Swap Station Location-Routing Problem with Capacitated Electric Vehicles
- Solving the joint production distribution problem by the variable neighborhood search algorithm
- Dynamic assignment problem of parking slots
- A variable neighborhood search algorithm for the capacitated vehicle routing problem
- New VNP for automatic programming
- GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem
- Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem
- A general variable neighborhood search for the swap-body vehicle routing problem
- Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion
- Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion
- EDA for dynamic assignment problem of parking slots.
- A variable neighborhood search algorithm for the vehicle routing problem with multiple trips
- Skewed general variable neighborhood search for the location routing scheduling problem
- A variable neighborhood search for solving the multi-vehicle covering tour problem
- 0 – 1 Quadratic Knapsack Problem solved with VNS algorithm
- 3rd International Conference on Variable Neighborhood Search (VNS'14)
- A general variable neighbourhood search for the multi-product inventory routing problem
- A hybrid approach combining column generation and variable neighborhood search for the location and routing problem
- VNS based heuristic for the Swap-Body Vehicle Routing Problem
- A two phase variable neighborhood search for the multi-product inventory routing problem
- The classroom assignment problem: Complexity, size reduction and heuristics
- Non-dominated Sorting Genetic Algorithm-II to solve bi-objective multi-mode resource-constrained project scheduling problem
- New Greedy Randomized Adaptive Search Procedure based on differential evolution algorithm for solving no-wait flowshop scheduling problem
- Solving blocking flowshop scheduling problem with branch and bound algorithm
- New lower bounds for the blocking flowshop scheduling problem to minimize the total completion time criterion
- Branch and bound algorithm for solving blocking flowshop scheduling problem with total completion time
- Variable neighborhood search for the location routing problem with multiple routes
- Hybrid Genetic Algorithm for Bi-objective Assignment Problem
- An Estimation of Distribution Algorithm for Part Cell Formation Problem
- Variable neighborhood search for location routing
- A variable neighborhood search for the multi-product inventory routing problem
- A differential evolution algorithm to solve redundancy allocation problems
- An Estimation of Distribution Algorithm for Part Cell Formation Problem
- Genetic algorithm with iterated local search for solving a location-routing problem
- A variable neighborhood search for the capacitated location-routing problem
- A bi-phase approach for the combined production and distribution problem
- Metaheuristics for the multi-item capacitated lot-sizing problem with time Windows and setup times
- A Hybrid Particle Swarm Optimization Algorithm for the Redundancy Allocation Problem
- A hybrid genetic algorithm for solving no-wait flowshop scheduling problems
- A Method for Selecting Pareto Optimal Solutions in Multiobjective Optimization
- A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times
- An Iterated Local Search for Solving A Location-Routing Problem
- A GRASP based on DE to solve single machine scheduling problem with SDST
- Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines
- PARTICLE SWARM OPTIMIZATION FOR SOLVING NLP AND MINLP IN CHEMICAL ENGINEERING
- An Estimation of Distribution Algorithm for Minimizing the Makespan in Blocking Flowshop Scheduling Problems
- Hybrid estimation of distribution algorithm for permutation flowshop scheduling problem with sequence dependent family setup times
- An Estimation of Distribution Algorithm for Flowshop Scheduling with Limited Buffers
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
- Differential evolution for solving multi-mode resource-constrained project scheduling problems
- A new destructive bounding scheme for the bin packing problem
- A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems
- Combinatorial particle swarm optimization (CPSO) for partitional clustering problem
- A combinatorial particle swarm optimisation for solving permutation flowshop problems
مجلات النشر
- Electronic Notes in Discrete Mathematics × 10
- Computers & Operations Research × 8
- HAL × 5
- International Journal of Mathematics in Operational Research × 4
- Springer eBooks × 3
- Expert Systems with Applications × 2
المنشورات حسب السنة
- 20252
- 20242
- 20232
- 20211
- 20204
- 20191
- 20173
- 20165
- 20155
- 20143
التعاون العلمي
المؤسسات الشريكة : Faculty of Economics and Management of Sfax · University of Sfax · Qassim University · University of Gafsa · Laboratoire Images, signaux et systèmes intelligents
بلدان المؤلفين المشاركين : فرنسا · السعودية · الإمارات
المؤلفون المشاركون
- Mansour Eddaly
- Abdelwaheb Rebaï
- Saïd Toumi
- Houda Derbel
- Habib Chabchoub
- Saber Ibrahim
- Taïcir Loukil
- N. Damak
- Noura Béji
- Nejah Ben Mabrouk
- Radhouan Bouabda
- Hanen Akrout
البيانات البيبليوغرافية مصدرها OpenAlex (قاعدة مفتوحة).
لماذا تختارون Dzcademia؟
ملفات أكاديمية ومقالات ومداخلات علمية: امنحوا أبحاثكم حضوراً عاماً منظماً. تساعد البيانات الوصفية المدمجة محركات البحث ومساعدات الذكاء الاصطناعي على التعرف على أعمالكم وفهم مراجعها.
علّق عبر Google
سجّل الدخول عبر Google للتعليق مباشرة على هذه الصفحة.