Preferred Language
Articles
/
ZRbDm4cBVTCNdQwCElhh
A Parallel Adaptive Genetic Algorithm for Job Shop Scheduling Problem
...Show More Authors

Publication Date
Sat Jan 01 2011
Journal Name
Journal Of The College Of Basic Education
Solving Job-Shop Scheduling Problem Using Genetic Algorithm Approach
...Show More Authors

Publication Date
Sat Oct 28 2023
Journal Name
Baghdad Science Journal
Diversity Operators-based Artificial Fish Swarm Algorithm to Solve Flexible Job Shop Scheduling Problem
...Show More Authors

Artificial fish swarm algorithm (AFSA) is one of the critical swarm intelligent algorithms. In this
paper, the authors decide to enhance AFSA via diversity operators (AFSA-DO). The diversity operators will
be producing more diverse solutions for AFSA to obtain reasonable resolutions. AFSA-DO has been used to
solve flexible job shop scheduling problems (FJSSP). However, the FJSSP is a significant problem in the
domain of optimization and operation research. Several research papers dealt with methods of solving this
issue, including forms of intelligence of the swarms. In this paper, a set of FJSSP target samples are tested
employing the improved algorithm to confirm its effectiveness and evaluate its ex

... Show More
View Publication Preview PDF
Scopus (3)
Crossref (2)
Scopus Crossref
Publication Date
Mon Apr 30 2018
Journal Name
Journal Of Theoretical And Applied Information Technology
An efficient artificial fish swarm algorithm with harmony search for scheduling in flexible job-shop problem
...Show More Authors

Flexible job-shop scheduling problem (FJSP) is one of the instances in flexible manufacturing systems. It is considered as a very complex to control. Hence generating a control system for this problem domain is difficult. FJSP inherits the job-shop scheduling problem characteristics. It has an additional decision level to the sequencing one which allows the operations to be processed on any machine among a set of available machines at a facility. In this article, we present Artificial Fish Swarm Algorithm with Harmony Search for solving the flexible job shop scheduling problem. It is based on the new harmony improvised from results obtained by artificial fish swarm algorithm. This improvised solution is sent to comparison to an overall best

... Show More
View Publication Preview PDF
Scopus (3)
Scopus
Publication Date
Fri Apr 01 2011
Journal Name
Al-mustansiriyah Journal Of Science
A Genetic Algorithm Based Approach For Generating Unit Maintenance Scheduling
...Show More Authors

Publication Date
Fri Apr 01 2022
Journal Name
Baghdad Science Journal
An Evolutionary Algorithm for Solving Academic Courses Timetable Scheduling Problem
...Show More Authors

Scheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating opti

... Show More
View Publication Preview PDF
Scopus (15)
Crossref (7)
Scopus Clarivate Crossref
Publication Date
Mon Oct 01 2018
Journal Name
Journal Of Economics And Administrative Sciences
Nurse Scheduling Problem Using Hybrid Simulated Annealing Algorithm
...Show More Authors

Nurse scheduling problem is one of combinatorial optimization problems and it is one of NP-Hard problems which is difficult to be solved as optimal solution. In this paper, we had created an proposed algorithm which it is hybrid simulated annealing algorithm to solve nurse scheduling problem, developed the simulated annealing algorithm and Genetic algorithm. We can note that the proposed algorithm (Hybrid simulated Annealing Algorithm(GS-h)) is the best method among other methods which it is used in this paper because it satisfied minimum average of the total cost and maximum number of Solved , Best and Optimal problems. So we can note that the ratios of the optimal solution are 77% for the proposed algorithm(GS-h), 28.75% for Si

... Show More
View Publication Preview PDF
Crossref
Publication Date
Fri Apr 30 2021
Journal Name
Iraqi Journal Of Science
A Genetic Algorithm for Task Allocation Problem in the Internet of Things
...Show More Authors

In the last few years, the Internet of Things (IoT) is gaining remarkable attention in both academic and industrial worlds. The main goal of the IoT is laying on describing everyday objects with different capabilities in an interconnected fashion to the Internet to share resources and to carry out the assigned tasks. Most of the IoT objects are heterogeneous in terms of the amount of energy, processing ability, memory storage, etc. However, one of the most important challenges facing the IoT networks is the energy-efficient task allocation. An efficient task allocation protocol in the IoT network should ensure the fair and efficient distribution of resources for all objects to collaborate dynamically with limited energy. The canonic

... Show More
Scopus (3)
Crossref (4)
Scopus Crossref
Publication Date
Fri Jan 01 2016
Journal Name
Journal Of Computer And Communications
Parallel Quick Search Algorithm for the Exact String Matching Problem Using OpenMP
...Show More Authors

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co

... Show More
View Publication Preview PDF
Crossref (3)
Crossref
Publication Date
Thu Jul 01 2021
Journal Name
Journal Of Physics: Conference Series
An Evolutionary Algorithm for Task scheduling Problem in the Cloud-Fog environment
...Show More Authors
Abstract<p>The rapid and enormous growth of the Internet of Things, as well as its widespread adoption, has resulted in the production of massive quantities of data that must be processed and sent to the cloud, but the delay in processing the data and the time it takes to send it to the cloud has resulted in the emergence of fog, a new generation of cloud in which the fog serves as an extension of cloud services at the edge of the network, reducing latency and traffic. The distribution of computational resources to minimize makespan and running costs is one of the disadvantages of fog computing. This paper provides a new approach for improving the task scheduling problem in a Cloud-Fog environme</p> ... Show More
View Publication
Scopus (14)
Crossref (3)
Scopus Crossref
Publication Date
Sun May 28 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Science
On-Line Navigational Problem of a Mobile Robot Using Genetic Algorithm
...Show More Authors