Preferred Language
Articles
/
jih-2677
Novel Heuristic Approach for Solving Multi-objective Scheduling Problems
...Show More Authors

    In this paper, we studied the scheduling of  jobs on a single machine.  Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completion time and maximum tardiness. The second is minimizing total completion time and maximum earliness. We used these efficient solutions to find a near-optimal solution for another problem which is a sum of maximum earliness and maximum tardiness. This means we eliminate the total completion time from the two problems. The algorithm was tested on a set of problems of different n. Computational results demonstrate the efficiency of the proposed method.

Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Mon Feb 01 2016
Journal Name
Swarm And Evolutionary Computation
Improving the performance of evolutionary multi-objective co-clustering models for community detection in complex social networks
...Show More Authors

Scopus (33)
Crossref (27)
Scopus Clarivate Crossref
Publication Date
Thu Jul 25 2019
Journal Name
Advances In Intelligent Systems And Computing
Solving Game Theory Problems Using Linear Programming and Genetic Algorithms
...Show More Authors

View Publication
Scopus (15)
Crossref (10)
Scopus Crossref
Publication Date
Sun Nov 01 2020
Journal Name
International Journal Of Engineering
Pavement Maintenance Management Using Multi-objective Optimization: (Case Study: Wasit Governorate-Iraq)
...Show More Authors

View Publication
Scopus (5)
Scopus Clarivate Crossref
Publication Date
Wed Mar 10 2021
Journal Name
Periodicals Of Engineering And Natural Sciences (pen)
A hybrid Grey Wolf optimizer with multi-population differential evolution for global optimization problems
...Show More Authors

View Publication
Scopus (2)
Crossref (1)
Scopus Crossref
Publication Date
Mon Jun 22 2020
Journal Name
Baghdad Science Journal
Phase Fitted And Amplification Fitted Of Runge-Kutta-Fehlberg Method Of Order 4(5) For Solving Oscillatory Problems
...Show More Authors

In this paper, the proposed phase fitted and amplification fitted of the Runge-Kutta-Fehlberg method were derived on the basis of existing method of 4(5) order to solve ordinary differential equations with oscillatory solutions. The recent method has null phase-lag and zero dissipation properties. The phase-lag or dispersion error is the angle between the real solution and the approximate solution. While the dissipation is the distance of the numerical solution from the basic periodic solution. Many of problems are tested over a long interval, and the numerical results have shown that the present method is more precise than the 4(5) Runge-Kutta-Fehlberg method.

View Publication Preview PDF
Scopus (1)
Scopus Clarivate Crossref
Publication Date
Sat Jun 01 2024
Journal Name
Alexandria Engineering Journal
U-Net for genomic sequencing: A novel approach to DNA sequence classification
...Show More Authors

The precise classification of DNA sequences is pivotal in genomics, holding significant implications for personalized medicine. The stakes are particularly high when classifying key genetic markers such as BRAC, related to breast cancer susceptibility; BRAF, associated with various malignancies; and KRAS, a recognized oncogene. Conventional machine learning techniques often necessitate intricate feature engineering and may not capture the full spectrum of sequence dependencies. To ameliorate these limitations, this study employs an adapted UNet architecture, originally designed for biomedical image segmentation, to classify DNA sequences.The attention mechanism was also tested LONG WITH u-Net architecture to precisely classify DNA sequences

... Show More
View Publication Preview PDF
Scopus (1)
Scopus Clarivate Crossref
Publication Date
Wed Jan 24 2018
Journal Name
The Journal Of Physical Chemistry C
Novel Approach for Fabricating Transparent and Conducting SWCNTs/ITO Thin Films for Optoelectronic Applications
...Show More Authors

View Publication
Scopus (34)
Crossref (35)
Scopus Clarivate Crossref
Publication Date
Mon Jan 01 2024
Journal Name
Ieee Access
Dual-Layer Compressive Sensing Scheme Incorporating Adaptive Cross Approximation Algorithm for Solving Monostatic Electromagnetic Scattering Problems
...Show More Authors

View Publication
Scopus Clarivate Crossref
Publication Date
Mon Mar 06 2023
Journal Name
Arts
Solving chemical problems among students of the College of Education for Pure Sciences, Ibn al-Haytham
...Show More Authors

Preview PDF
Publication Date
Sun Sep 01 2019
Journal Name
Gazi University Journal Of Science
Reliable Iterative Methods for Solving Convective Straight and Radial Fins with Temperature-Dependent Thermal Conductivity Problems
...Show More Authors

In our article, three iterative methods are performed to solve the nonlinear differential equations that represent the straight and radial fins affected by thermal conductivity. The iterative methods are the Daftardar-Jafari method namely (DJM), Temimi-Ansari method namely (TAM) and Banach contraction method namely (BCM) to get the approximate solutions. For comparison purposes, the numerical solutions were further achieved by using the fourth Runge-Kutta (RK4) method, Euler method and previous analytical methods that available in the literature. Moreover, the convergence of the proposed methods was discussed and proved. In addition, the maximum error remainder values are also evaluated which indicates that the propo

... Show More
View Publication
Crossref (5)
Crossref