Preferred Language
Articles
/
jih-221
Minimizing the Total Completion Times, the Total Tardiness and the Maximum Tardiness
...Show More Authors

In this paper, the main work is to minimize a function of three cost criteria for scheduling n jobs on a single machine. We proposed algorithms to solve the single machine scheduling multiobjective problem. In this problem, we consider minimizing the total completion times, total tardiness and maximum tardiness criteria. First a branch and bound (BAB) algorithm is applied for the 1//∑Ci+∑Ti+Tmax problem. Second we compare two multiobjective algorithms one of them based on (BAB) algorithm to find the set of efficient (non dominated) solutions for the 1//(∑Ci ,∑Ti ,Tmax) problem. The computational results show that the algorithm based on (BAB) algorithm is better than the other one for generated the total number of non dominated solutions. 

View Publication Preview PDF
Quick Preview PDF
Publication Date
Mon Jul 01 2024
Journal Name
Alexandria Engineering Journal
Comparison of some Bayesian estimation methods for type-I generalized extreme value distribution with simulation
...Show More Authors

The Weibull distribution is considered one of the Type-I Generalized Extreme Value (GEV) distribution, and it plays a crucial role in modeling extreme events in various fields, such as hydrology, finance, and environmental sciences. Bayesian methods play a strong, decisive role in estimating the parameters of the GEV distribution due to their ability to incorporate prior knowledge and handle small sample sizes effectively. In this research, we compare several shrinkage Bayesian estimation methods based on the squared error and the linear exponential loss functions. They were adopted and compared by the Monte Carlo simulation method. The performance of these methods is assessed based on their accuracy and computational efficiency in estimati

... Show More
View Publication
Scopus (2)
Scopus Clarivate Crossref
Publication Date
Sun Feb 01 2015
Journal Name
Journal Of Engineering
Non-Linear Analysis of Laminated Composite Plates under General Out-Of-Plane Loading
...Show More Authors

The theoretical analysis depends on the Classical Laminated Plate Theory (CLPT) that is based on the Von-K ráman Theory and Kirchhov Hypothesis in the deflection analysis during elastic limit as well as the Hooke's laws of calculation the stresses. New function for boundary condition is used to solve the forth degree of differential equations which depends on variety sources of advanced engineering mathematics. The behavior of composite laminated plates, symmetric and anti-symmetric of cross-ply angle, under out-of-plane loads (uniform distributed loads) with two different boundary conditions are investigated to obtain the central deflection for mid-plane by using the Ritz method. The computer programs is built using Ma

... Show More
View Publication Preview PDF
Publication Date
Thu Nov 30 2023
Journal Name
Iraqi Journal Of Science
Boubaker Scaling Operational Matrices for Solving Calculus of Variation Problems
...Show More Authors

     In this paper, a general expression formula for the Boubaker scaling (BS) operational matrix of the derivative is constructed. Then it is used to study a new parameterization direct technique for treating calculus of the variation problems approximately. The calculus of variation problems describe several important phenomena in mathematical science. The first step in our suggested method is to express the unknown variables in terms of Boubaker scaling basis functions with unknown coefficients. Secondly, the operational matrix of the derivative together with some important properties of the BS are utilized to achieve a non-linear programming problem in terms of the unknown coefficients. Finally, the unknown parameters are obtaine

... Show More
View Publication Preview PDF
Scopus Crossref
Publication Date
Sat Apr 30 2022
Journal Name
Iraqi Journal Of Science
Convergence Theorems of Three-Step Iteration Algorithm in CAT (0) Spaces
...Show More Authors

      In this paper, a modified three-step iteration algorithm for approximating a joint fixed point of non-expansive and contraction mapping is studied. Under appropriate conditions, several strong convergence theorems and Δ-convergence theorems are established in a complete CAT (0) space. a numerical example is introduced to show that this modified iteration algorithm is faster than other iteration algorithms. Finally, we prove that the modified iteration algorithm is stable. Therefore these results are extended and improved to a novel results that are stated by other researchers. Our results are also complement to many well-known theorems in the literature. This type of research can be played a vital role in computer programming

... Show More
View Publication Preview PDF
Scopus (1)
Scopus Crossref
Publication Date
Mon Aug 26 2019
Journal Name
Iraqi Journal Of Science
Exact Methods for Solving Multi-Objective Problem on Single Machine Scheduling
...Show More Authors

     In this paper, one of the Machine Scheduling Problems is studied, which is the problem of scheduling a number of products (n-jobs) on one (single) machine with the multi-criteria objective function. These functions are (completion time, the tardiness, the earliness, and the late work) which formulated as . The branch and bound (BAB) method are used as the main method for solving the problem, where four upper bounds and one lower bound are proposed and a number of dominance rules are considered to reduce the number of branches in the search tree. The genetic algorithm (GA) and the particle swarm optimization (PSO) are used to obtain two of the upper bounds. The computational results are calculated by coding (progr

... Show More
View Publication Preview PDF
Scopus (10)
Crossref (7)
Scopus Crossref
Publication Date
Sun Dec 17 2017
Journal Name
Al-khwarizmi Engineering Journal
Formation of Compressive Residual Stress by Face Milling Steel AISI 1045
...Show More Authors

Abstract

     Machining residual stresses correlate very closely with the cutting parameters and the tool geometries. This research work aims to investigate the effect of cutting speed, feed rate and depth of cut on the surface residual stress of steel AISI 1045 after face milling operation. After each milling test, the residual stress on the surface of the workpiece was measured by using X-ray diffraction technique. Design of Experiment (DOE) software was employed using the response surface methodology (RSM) technique with a central composite rotatable design to build a mathematical model to determine the relationship between the input variables and the response. The results showed that both

... Show More
View Publication Preview PDF
Publication Date
Fri Jul 01 2016
Journal Name
Journal Of Engineering
An Adaptive Multi-Objective Particle Swarm Optimization Algorithm for Multi-Robot Path Planning
...Show More Authors

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord

... Show More
View Publication Preview PDF
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 (1)
Scopus Crossref
Publication Date
Tue Feb 13 2024
Journal Name
Iraqi Journal Of Science
Parameters Estimation for Modified Weibull Distribution Based on Type One Censored Samplest
...Show More Authors

The three parameters distribution called modified weibull distribution (MWD) was introduced first by Sarhan and Zaindin (2009)[1]. In theis paper, we deal with interval estimation to estimate the parameters of modified weibull distribution based on singly type one censored data, using Maximum likelihood method and fisher information to obtain the estimates of the parameters for modified weibull distribution, after that applying this technique to asset of real data which taken for Leukemia disease in the hospital of central child teaching .

View Publication Preview PDF
Publication Date
Thu May 18 2023
Journal Name
Journal Of Engineering
A Comparative Study of Single-Constraint Routing in Wireless Mesh Networks Using Different Dynamic Programming Algorithms
...Show More Authors

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith

... Show More
View Publication Preview PDF
Crossref (1)
Crossref