Accueil › Annuaire des chercheurs › Mansour Eddaly
Mansour Eddaly
Affiliation : Faculty of Economics and Management of Sfax · University of Sfax
- 27Publications (affiliation tunisienne)
- 42Publications au total
- 556Citations
- 9Indice h
Profil de recherche
Mansour Eddaly compte 27 publications référencées (2008–2023). Ses travaux paraissent principalement dans « International Journal of Mathematics in Operational Research », « International Journal of Operational Research » et « Computers & Operations Research ». Son article le plus cité, « An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems » (2008), a été cité 156 fois. 3 de ces publications datent des trois dernières années d’activité. Ses travaux sont cosignés avec au moins 12 chercheurs, notamment dans des établissements de Arabie saoudite, Émirats arabes unis, Serbie.
C’est vous ? Faites connaître vos travaux
Créez gratuitement votre profil DzCademia et ajoutez vos articles : ils apparaîtront plus facilement sur Google et dans les assistants d’IA comme ChatGPT. Plus de personnes pourront vous lire et vous citer.
Créer mon profil gratuit Ajouter mes publicationsDomaines de recherche
- Scheduling and Optimization Algorithms
- Advanced Manufacturing and Logistics Optimization
- Healthcare Operations and Scheduling Optimization
- Metaheuristic Optimization Algorithms Research
- Vehicle Routing Optimization Methods
Publications (27)
- Metaheuristics for Machine Learning
- Mixed integer linear programming formulations for the permutation flow shop scheduling problem with preventive maintenance activities
- Solving the joint production distribution problem by the variable neighbourhood search algorithm
- Solving the joint production distribution problem by the variable neighborhood search algorithm
- Variable neighborhood search algorithms for the permutation flowshop scheduling problem with the preventive maintenance
- A variable neighborhood search algorithm for the capacitated vehicle routing problem
- Branch and bound algorithm for solving blocking flowshop scheduling problem with total tardiness and total weighted tardiness criteria
- Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times
- Branch and bound algorithm for solving blocking flowshop scheduling problem with total tardiness and total weighted tardiness criteria
- Combinatorial particle swarm optimization for solving blocking flowshop scheduling 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
- 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
- Hybrid Genetic Algorithm for Bi-objective Assignment 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 branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times
- Hierarchical production planning with flexibility in agroalimentary environment: a case study
- 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
Revues de publication
- International Journal of Mathematics in Operational Research × 5
- International Journal of Operational Research × 2
- Computers & Operations Research × 2
- Studies in computational intelligence × 2
- Computational intelligence methods and applications × 1
- Operational Research × 1
Publications par année
- 20232
- 20211
- 20201
- 20191
- 20174
- 20163
- 20134
- 20112
- 20105
- 20093
Collaborations
Établissements partenaires : Qassim University · Liwa University · University of Belgrade · Higher Colleges of Technology · Majmaah University
Pays des co-auteurs : Arabie saoudite · Émirats arabes unis · Serbie
Co-auteurs
- Bassem Jarboui
- Abdelwaheb Rebaï
- Saïd Toumi
- Ridha Erromdhani
- Nejah Ben Mabrouk
- Habib Chabchoub
- Radhouan Bouabda
- Houda Derbel
- Marwa Amous
- Noura Béji
- Najeh Ben Mabrouk
- Wahiba Jomaa
Données bibliographiques issues d’OpenAlex (base ouverte).
Pourquoi choisir Dzcademia ?
Pour donner à vos travaux plus de chances d’être découverts et recommandés par les IA. Profils, articles et communications : donnez à votre recherche une présence publique structurée. Les métadonnées intégrées aident les moteurs de recherche et les assistants IA à identifier vos travaux et à comprendre leurs références.
Commenter avec Google
Connecte-toi avec Google pour commenter directement sur cette page.