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
Sun Dec 08 2019
Journal Name
Periodicals Of Engineering And Natural Sciences (pen)
Estimating total dissolved solids and total suspended solids in Mosul dam lake in situ and using remote sensing technique
...Show More Authors

View Publication
Scopus (8)
Crossref (6)
Scopus 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
Thu Nov 02 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Total Protein and Total Fucose in Sera of Patients with Thyroid Dysfunction and Control
...Show More Authors

Total protein and total fucose were determined in sera of thyroid

disorder patients.

Sera of (40) diagnosed by consultant hyperthyroidism, and 40 hypothyroidism  were analyzed  for  the above  parameter  for  control, sera of (40) normal individuals were used.

They   were   healthy   with    no  appearing   disorder   results   analysis revealed  no significant  differences  (P<0.05)  in  the (mean  Â±SD)  of total   protein   values  in   sera  of   hyper  and   hypothyroidism   were compared

... Show More
View Publication Preview PDF
Publication Date
Sat Oct 01 2016
Journal Name
I-manager’s Journal On Communication Engineering And Systems
SOLVING NETWORK CONGESTION PROBLEM BY QUALITY OF SERVICE ANALYSIS USING OPNET
...Show More Authors

Among many problems that reduced the performance of the network, especially Wide Area Network, congestion is one of these, which is caused when traffic request reaches or exceeds the available capacity of a route, resulting in blocking and less throughput per unit time. Congestion management attributes try to manage such cases. The work presented in this paper deals with an important issue that is the Quality of Service (QoS) techniques. QoS is the combination effect on service level, which locates the user's degree of contentment of the service. In this paper, packet schedulers (FIFO, WFQ, CQ and PQ) were implemented and evaluated under different applications with different priorities. The results show that WFQ scheduler gives acceptable r

... Show More
Publication Date
Thu Jun 01 2023
Journal Name
Baghdad Science Journal
Effective Computational Methods for Solving the Jeffery-Hamel Flow Problem
...Show More Authors

In this paper, the effective computational method (ECM) based on the standard monomial polynomial has been implemented to solve the nonlinear Jeffery-Hamel flow problem. Moreover, novel effective computational methods have been developed and suggested in this study by suitable base functions, namely Chebyshev, Bernstein, Legendre, and Hermite polynomials. The utilization of the base functions converts the nonlinear problem to a nonlinear algebraic system of equations, which is then resolved using the Mathematica®12 program. The development of effective computational methods (D-ECM) has been applied to solve the nonlinear Jeffery-Hamel flow problem, then a comparison between the methods has been shown. Furthermore, the maximum

... Show More
View Publication Preview PDF
Scopus (2)
Scopus Crossref
Publication Date
Wed Dec 18 2019
Journal Name
Baghdad Science Journal
The Calculation and Analysis of the Total Electron Content Over Different Latitudes and Seasons Using the Numerical Trapezoidal and Simpson Methods
...Show More Authors

It has been shown in ionospheric research that calculation of the total electron content (TEC) is an important factor in global navigation system. In this study, TEC calculation was performed over Baghdad city, Iraq, using a combination of two numerical methods called composite Simpson and composite Trapezoidal methods. TEC was calculated using the line integral of the electron density derived from the International reference ionosphere IRI2012 and NeQuick2 models from 70 to 2000 km above the earth surface. The hour of the day and the day number of the year, R12, were chosen as inputs for the calculation techniques to take into account latitudinal, diurnal and seasonal variation of TEC. The results of latitudinal variation of TE

... Show More
View Publication Preview PDF
Scopus Clarivate Crossref
Publication Date
Mon Jan 01 2024
Journal Name
Applied And Computational Mathematics
Reliable computational methods for solving Jeffery-Hamel flow problem based on polynomial function spaces
...Show More Authors

In this paper reliable computational methods (RCMs) based on the monomial stan-dard polynomials have been executed to solve the problem of Jeffery-Hamel flow (JHF). In addition, convenient base functions, namely Bernoulli, Euler and Laguerre polynomials, have been used to enhance the reliability of the computational methods. Using such functions turns the problem into a set of solvable nonlinear algebraic system that MathematicaⓇ12 can solve. The JHF problem has been solved with the help of Improved Reliable Computational Methods (I-RCMs), and a review of the methods has been given. Also, published facts are used to make comparisons. As further evidence of the accuracy and dependability of the proposed methods, the maximum error remainder

... Show More
View Publication
Scopus Clarivate Crossref
Publication Date
Sun Apr 01 2018
Journal Name
Journal Of Economics And Administrative Sciences
Determine Optimal Preventive Maintenance Time Using Scheduling Method
...Show More Authors

In this paper, the reliability and scheduling of maintenance of some medical devices were estimated by one variable, the time variable (failure times) on the assumption that the time variable for all devices has the same distribution as (Weibull distribution.

The method of estimating the distribution parameters for each device was the OLS method.

The main objective of this research is to determine the optimal time for preventive maintenance of medical devices. Two methods were adopted to estimate the optimal time of preventive maintenance. The first method depends on the maintenance schedule by relying on information on the cost of maintenance and the cost of stopping work and acc

... Show More
View Publication Preview PDF
Crossref
Publication Date
Tue Apr 20 2021
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
The Galerkin-Implicit Methods for Solving Nonlinear Hyperbolic Boundary Value Problem
...Show More Authors

This paper is concerned with finding the approximation solution (APPS) of a certain type of nonlinear hyperbolic boundary value problem (NOLHYBVP).  The given BVP is written in its discrete (DI) weak form (WEF), and is proved that  it has a unique APPS, which is obtained via the mixed Galerkin finite element method (GFE) with implicit method (MGFEIM) that reduces the problem to solve the Galerkin nonlinear algebraic system  (GNAS).  In this part, the predictor and the corrector technique (PT and CT) are proved convergent and are used to transform the obtained GNAS to  linear (GLAS ), then the GLAS is solved using the Cholesky method (ChMe). The stability and the convergence of the method are studied. The results

... Show More
View Publication Preview PDF
Crossref
Publication Date
Tue Sep 29 2020
Journal Name
Iraqi Journal Of Science
Mixed Implicit Galerkin – Frank Wolf, Gradient and Gradient Projection Methods for Solving Classical Optimal Control Problem Governed by Variable Coefficients, Linear Hyperbolic, Boundary Value Problem
...Show More Authors

This paper deals with testing a numerical solution for the discrete classical optimal control problem governed by a linear hyperbolic boundary value problem with variable coefficients. When the discrete classical control is fixed, the proof of the existence and uniqueness theorem for the discrete solution of the discrete weak form is achieved. The existence theorem for the discrete classical optimal control and the necessary conditions for optimality of the problem are proved under suitable assumptions. The discrete classical optimal control problem (DCOCP) is solved by using the mixed Galerkin finite element method to find the solution of the discrete weak form (discrete state). Also, it is used to find the solution for the discrete adj

... Show More
View Publication Preview PDF
Scopus Crossref