Mohamed Kurdi

Mohamed Kurdi
Verified
Mohamed verified their affiliation via an institutional email.
Verified
Mohamed verified their affiliation via an institutional email.
  • Professor
  • Professor and Dean, Faculty of Informatics Engineering at Idlib University

About

16
Publications
1,798
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
394
Citations
Current institution
Idlib University
Current position
  • Professor and Dean, Faculty of Informatics Engineering
Additional affiliations
March 2014 - September 2022
Adnan Menderes University
Position
  • Asisstant Professor
Education
June 2007 - June 2011
University of Aleppo
Field of study
  • Computer Science
September 2002 - December 2004
Dalarna University
Field of study
  • Computer Science

Publications

Publications (16)
Article
This work proposes a new metaheuristic algorithm (ACONEH) for open shop scheduling problem (OSSP) with makespan minimization. The aim is to improve the exploration capability of ant colony optimization (ACO) and also solve OSSP more effectively. This is achieved by introducing a new heuristic information approach that utilizes three exploratory cha...
Article
This paper presents an ant colony system with a novel Non-DaemonActions procedure (ACSNDP) algorithm for multiprocessor task scheduling in multistage hybrid flow shop. A DaemonActions procedure is an optional component of ant colony optimization (ACO), which integrates problem-specific actions that cannot be performed by single ants such as the act...
Article
This work proposes an improved island model memetic algorithm with a new naturally inspired cooperation phase (IIMMA) for multi-objective job shop scheduling problem. Three objective functions: makespan, total weighted tardiness, and total weighted earliness are considered using the weighting approach. The new cooperation phase is mainly used to im...
Article
Full-text available
Permutation flow shop scheduling problem (PFSP) is an NP-complete problem with a wide range of applications in many real-world applications. Social spider optimization (SSO) is a swarm intelligence algorithm proposed for continuous optimization problems. Recently, SSO has received increased interest in the field of combinatorial optimization as wel...
Article
Full-text available
Hybrid flow shop scheduling with multiprocessor task (HFSPMT) is a strongly NP-hard problem that has a wide range of applications in several real-life industrial environments. Due to its essential complexity and practical relevance, HFSPMT has been of an increasing interest for researchers and industrialists in the last two decades. Social spider o...
Book
Full-text available
يعرض هذا الكتاب مفاهيم أساسية في نظرية البيان وتطبيقات متنوعة لها في الحياة الواقعية بدءًا من الخوارزميات البسيطة وانتهاءً بالمسائل المعقدة، وكيفية حل العديد من المسائل الواقعية التي نواجهها يومياً. يعمل هذا الكتاب على تحقيق التوازن بين القيمة النظرية والقيمة العملية للعديد من مفاهيم نظرية البيان لنضمن أن كل مفهوم لا يتم دراسته نظرياً فحسب، بل يتم...
Article
Full-text available
The optimization of the vaccination campaign and medication distribution in rural regions of Morocco conducted by the Ministry of Health can be significantly improved by employing metaheuristic algorithms in conjunction with a tour planning system. This research proposes the utilization of six metaheuristic algorithms: genetic algorithm, rat swarm...
Article
Full-text available
The quadratic assignment problem (QAP) is an NP-hard problem with a wide range of applications in many real-world applications. This study introduces a discrete rat swarm optimizer (DRSO)algorithm for the first time as a solution to the QAP and demonstrates its effectiveness in terms of solution quality and computational efficiency. To address the...
Article
Full-text available
The spotted hyena optimization algorithm (SHOA) is a novel approach for solving the flow shop-scheduling problem in manufacturing and production settings. The motivation behind SHOA is to simulate the social dynamics and problem-solving behaviors of spotted hyena packs in order to identify and implement optimal schedules for jobs in a flow shop env...
Article
This paper proposes a memetic algorithm (MA) with novel semi-constructive crossover and mutation operators (MASC) to minimize makespan in permutation flowshop scheduling problem (PFSP). MASC combines the strengths of genetic algorithm (GA), simulated annealing (SA), and Nawaz–Enscore–Ham (NEH) algorithm. The aim is to enhance GA in identifying prom...
Article
Full-text available
This work presents an effective genetic algorithm with a critical-path-guided Giffler and Thompson crossover operator for job shop scheduling problem with the objective of makespan minimization (GA-CPG-GT). Even though passing important traits from parents to offspring is known to be an important feature of any uniform crossover operator, most of t...
Article
This paper presents an effective new island model genetic algorithm to solve the well-known job shop scheduling problem with the objective of minimizing the makespan. To improve the effectiveness of the classical island model genetic algorithm, we have proposed a new naturally inspired evolution model and a new naturally inspired migration selectio...
Article
Abstract This paper presents a new hybrid island model genetic algorithm (HIMGA) to solve the well-known job shop scheduling problem (JSSP) with the objective of makespan minimization. To improve the effectiveness of the island model genetic algorithm (IMGA), we have proposed a new naturally inspired self-adaptation phase strategy that is capable o...

Network

Cited By