Mansour Eddaly
Orcid: 0000-0002-0470-6946
  According to our database1,
  Mansour Eddaly
  authored at least 13 papers
  between 2009 and 2024.
  
  
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
- 
    on orcid.org
On csauthors.net:
Bibliography
  2024
    Discret. Appl. Math., 2024
    
  
Epsilon Oscillation Algorithm for the bi-objective green identical parallel machine scheduling problem.
    
  
    Comput. Oper. Res., 2024
    
  
  2023
Mixed integer linear programming formulations for the permutation flow shop scheduling problem with preventive maintenance activities.
    
  
    Int. J. Math. Oper. Res., 2023
    
  
  2021
Variable neighborhood search algorithms for the permutation flowshop scheduling problem with the preventive maintenance.
    
  
    Oper. Res., 2021
    
  
Solving the joint production distribution problem by the variable neighbourhood search algorithm.
    
  
    Int. J. Math. Oper. Res., 2021
    
  
  2017
Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion.
    
  
    Int. J. Math. Oper. Res., 2017
    
  
A variable neighborhood search algorithm for the capacitated vehicle routing problem.
    
  
    Electron. Notes Discret. Math., 2017
    
  
  2016
Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem.
    
  
    J. Comput. Des. Eng., 2016
    
  
  2012
Hierarchical production planning with flexibility in agroalimentary environment: a case study.
    
  
    J. Intell. Manuf., 2012
    
  
  2011
A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times.
    
  
    Comput. Oper. Res., 2011
    
  
  2010
A Hybrid Particle Swarm Optimization Algorithm for the Redundancy Allocation Problem.
    
  
    J. Comput. Sci., 2010
    
  
  2009
An Estimation of Distribution Algorithm for Flowshop Scheduling with Limited Buffers.
    
  
    Proceedings of the Natural Intelligence for Scheduling, Planning and Packing Problems, 2009
    
  
An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems.
    
  
    Comput. Oper. Res., 2009