Preferred Language
Articles
/
xhedJZIBVTCNdQwCEJ6q
Solving tri-criteria: total completion time, total late work, and maximum earliness by using exact, and heuristic methods on single machine scheduling problem
...Show More Authors

The presented study investigated the scheduling regarding  jobs on a single machine. Each  job will be processed with no interruptions and becomes available for the processing at time 0. The aim is finding a processing order with regard to jobs, minimizing total completion time , total late work , and maximal tardiness  which is an NP-hard problem. In the theoretical part of the present work, the mathematical formula for the examined problem will be presented, and a sub-problem of the original problem of minimizing the multi-objective functions  is introduced. Also, then the importance regarding the dominance rule (DR) that could be applied to the problem to improve good solutions will be shown. While in the practical part, two exact methods are important; a Branch and Bound algorithm (BAB) and a complete enumeration (CEM) method are applied to solve the three proposed MSP criteria by finding a set of efficient solutions. The experimental results showed that CEM can solve problems for up to  jobs. Two approaches of the BAB method were applied: the first approach was BAB without dominance rule (DR), and the BAB method used dominance rules to reduce the number of sequences that need to be considered. Also, this method can solve problems for up to , and the second approach BAB with dominance rule (DR), can solve problems for up to  jobs in a reasonable time to find efficient solutions to this problem. In addition, to find good approximate solutions, two heuristic methods for solving the problem are proposed, the first heuristic method can solve up to  jobs, while the second heuristic method can solve up to  jobs. Practical experiments prove the good performance regarding the two suggested approaches for the original problem. While for a sub-problem the experimental results showed that CEM can solve problems for up to  jobs, the BAB without dominance rule (DR) can solve problems for up to , and the second approach BAB with dominance rule (DR), can solve problems for up to  jobs in a reasonable time to find efficient solutions to this problem. Finally, the heuristic method can solve up to jobs. Arithmetic results are calculated by coding (programming) algorithms using (MATLAB 2019a)  

Scopus Crossref
View Publication
Publication Date
Wed May 13 2020
Journal Name
Nonlinear Engineering
Two meshless methods for solving nonlinear ordinary differential equations in engineering and applied sciences
...Show More Authors
Abstract<p>In this paper, two meshless methods have been introduced to solve some nonlinear problems arising in engineering and applied sciences. These two methods include the operational matrix Bernstein polynomials and the operational matrix with Chebyshev polynomials. They provide an approximate solution by converting the nonlinear differential equation into a system of nonlinear algebraic equations, which is solved by using <italic>Mathematica</italic>® 10. Four applications, which are the well-known nonlinear problems: the magnetohydrodynamic squeezing fluid, the Jeffery-Hamel flow, the straight fin problem and the Falkner-Skan equation are presented and solved using the proposed methods. To ill</p> ... Show More
View Publication
Crossref (11)
Crossref
Publication Date
Wed Aug 30 2023
Journal Name
Iraqi Journal Of Science
Computational methods for solving nonlinear ordinary differential equations arising in engineering and applied sciences
...Show More Authors

In this paper, the computational method (CM) based on the standard polynomials has been implemented to solve some nonlinear differential equations arising in engineering and applied sciences. Moreover, novel computational methods have been developed in this study by orthogonal base functions, namely Hermite, Legendre, and Bernstein polynomials. The nonlinear problem is successfully converted into a nonlinear algebraic system of equations, which are then solved by Mathematica®12. The developed computational methods (D-CMs) have been applied to solve three applications involving well-known nonlinear problems: the Darcy-Brinkman-Forchheimer equation, the Blasius equation, and the Falkner-Skan equation, and a comparison between the met

... Show More
View Publication
Scopus (2)
Crossref (1)
Scopus Crossref
Publication Date
Wed May 13 2020
Journal Name
Nonlinear Engineering
Two meshless methods for solving nonlinear ordinary differential equations in engineering and applied sciences
...Show More Authors
Abstract<p>In this paper, two meshless methods have been introduced to solve some nonlinear problems arising in engineering and applied sciences. These two methods include the operational matrix Bernstein polynomials and the operational matrix with Chebyshev polynomials. They provide an approximate solution by converting the nonlinear differential equation into a system of nonlinear algebraic equations, which is solved by using <italic>Mathematica</italic>® 10. Four applications, which are the well-known nonlinear problems: the magnetohydrodynamic squeezing fluid, the Jeffery-Hamel flow, the straight fin problem and the Falkner-Skan equation are presented and solved using the proposed methods. To ill</p> ... Show More
Scopus (16)
Crossref (11)
Scopus Clarivate Crossref
Publication Date
Sun Mar 01 2020
Journal Name
Gazi University Journal Of Science
Reliable Iterative Methods for Solving the Falkner-Skan Equation
...Show More Authors

View Publication
Crossref (8)
Crossref
Publication Date
Fri Dec 30 2022
Journal Name
Iraqi Journal Of Science
The Operational Matrices Methods for Solving Falkner-Skan Equations
...Show More Authors

     The method of operational matrices is based on the Bernoulli and Shifted Legendre polynomials which is used to solve the Falkner-Skan equation. The nonlinear differential equation converting to a system of nonlinear equations is solved using Mathematica®12, and the approximate solutions are obtained. The efficiency of these methods was studied by calculating the maximum error remainder ( ), and it was found that their efficiency increases as  increases. Moreover, the obtained approximate solutions are compared with the numerical solution obtained by the fourth-order Runge-Kutta method (RK4), which gives  a good agreement.

View Publication
Scopus (1)
Crossref (1)
Scopus Crossref
Publication Date
Thu Jun 29 2023
Journal Name
Wasit Journal For Pure Sciences
Suitable Methods for Solving COVID-19 Model in Iraq
...Show More Authors

Because the Coronavirus epidemic spread in Iraq, the COVID-19 epidemic of people quarantined due to infection is our application in this work. The numerical simulation methods used in this research are more suitable than other analytical and numerical methods because they solve random systems. Since the Covid-19 epidemic system has random variables coefficients, these methods are used. Suitable numerical simulation methods have been applied to solve the COVID-19 epidemic model in Iraq. The analytical results of the Variation iteration method (VIM) are executed to compare the results. One numerical method which is the Finite difference method (FD) has been used to solve the Coronavirus model and for comparison purposes. The numerical simulat

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sat Aug 24 2024
Journal Name
Mathematics
Identification of Time-Wise Thermal Diffusivity, Advection Velocity on the Free-Boundary Inverse Coefficient Problem
...Show More Authors

This paper is concerned with finding solutions to free-boundary inverse coefficient problems. Mathematically, we handle a one-dimensional non-homogeneous heat equation subject to initial and boundary conditions as well as non-localized integral observations of zeroth and first-order heat momentum. The direct problem is solved for the temperature distribution and the non-localized integral measurements using the Crank–Nicolson finite difference method. The inverse problem is solved by simultaneously finding the temperature distribution, the time-dependent free-boundary function indicating the location of the moving interface, and the time-wise thermal diffusivity or advection velocities. We reformulate the inverse problem as a non-

... Show More
View Publication Preview PDF
Scopus (1)
Crossref (1)
Scopus Clarivate 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
Sun Jan 25 2015
Journal Name
International Journal Of Applied Mathematical Research
Exact solutions to linear and nonlinear wave and diffusion equations
...Show More Authors

View Publication
Crossref (4)
Crossref
Publication Date
Wed Jan 01 2020
Journal Name
Advances In Intelligent Systems And Computing
Forecasting by Using the Optimal Time Series Method
...Show More Authors

View Publication
Scopus (19)
Crossref (10)
Scopus Crossref