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)
Mixture experiments are response variables based on the proportions of component for this mixture. In our research we will compare the scheffʼe model with the kronecker model for the mixture experiments, especially when the experimental area is restricted.
Because of the experience of the mixture of high correlation problem and the problem of multicollinearity between the explanatory variables, which has an effect on the calculation of the Fisher information matrix of the regression model.
to estimate the parameters of the mixture model, we used the (generalized inverse ) And the Stepwise Regression procedure
... Show MoreGeographic information system (GIS) is utilized in a variety of tasks such as, resource management, urban planning, emergency planning in case of accident, and rapid response etc. The aim of this study is to produce a digital map with the aid of GIS and a survey data. A survey data is conducted with Total Station technique on sanitary planning positions. The campus of Baghdad University is chosen to test the execution and accuracy of the results for sewer manholes locations. During the field survey, Total Station (Nikon Nivo) is used to identify the 3-D coordinates for each location. Finally, Geographical Information System (GIS) are utilized to present the digital map of the network sewer pipe line to the end users. Although Geographic Inf
... Show MoreAbstract
The current study was conducted to assess the effect of advancing age on total serum IgE level in asthmatic patients. To this purpose, 90 asthmatic patients and 30 healthy individuals ( control group ) were enrolled. Asthmatic patients were categorized into four groups. Group A consisted of asthmatic patients (9) whose age was more than 20 and up to 30 y. Group B contained asthmatics (13) of age more than 30 and up to 40 y. Group C comprised those (23) of more than 40 and up to 50 y. Group D consisted asthmatic patients (45) of age more than 50 y. Total serum IgE level significantly changed in group D patients when compared with those of
In this paper, we deal with the problem of general matching of two images one of them has experienced geometrical transformations, to find the correspondence between two images. We develop the invariant moments for traditional techniques (moments of inertia) with new approach to enhance the performance for these methods. We test various projections directional moments, to extract the difference between Block Distance Moment (BDM) and evaluate their reliability. Three adaptive strategies are shown for projections directional moments, that are raster (vertical and horizontal) projection, Fan-Bean projection and new projection procedure that is the square projection method. Our paper started with the description of a new algorithm that is low
... Show MoreThis study discussed a biased estimator of the Negative Binomial Regression model known as (Liu Estimator), This estimate was used to reduce variance and overcome the problem Multicollinearity between explanatory variables, Some estimates were used such as Ridge Regression and Maximum Likelihood Estimators, This research aims at the theoretical comparisons between the new estimator (Liu Estimator) and the estimators
Support Vector Machines (SVMs) are supervised learning models used to examine data sets in order to classify or predict dependent variables. SVM is typically used for classification by determining the best hyperplane between two classes. However, working with huge datasets can lead to a number of problems, including time-consuming and inefficient solutions. This research updates the SVM by employing a stochastic gradient descent method. The new approach, the extended stochastic gradient descent SVM (ESGD-SVM), was tested on two simulation datasets. The proposed method was compared with other classification approaches such as logistic regression, naive model, K Nearest Neighbors and Random Forest. The results show that the ESGD-SVM has a
... Show MoreBored piles settlement behavior under vertical loaded is the main factor that affects the design requirements of single or group of piles in soft soils. The estimation of bored pile settlement is a complicated problem because it depends upon many factors which may include ground conditions, validation of bored pile design method through testing and validation of theoretical or numerical prediction of the settlement value. In this study, a prototype single and bored pile group model of arrangement (1*1, 1*2 and 2*2) for total length to diameter ratios (L/D) is 13.33 and clear spacing three times of diameter, subjected to vertical axial loads. The bored piles model used for the test was 2000
... Show MoreThe present study investigated the total content of phenolic compounds, antioxidant and antimicrobial activities of water extracts oat (Avena sativa) and basil (Ocimum basilicum), medicinal plants. The Folin-ciocalteu reagent assay was used to estimate the total phenolic content of plants extract. The antioxidant capacity of the plants extract was tested by ferric reducing/antioxidant power Assay (FRAP) and ferric reducing scavenging activity using DPPH method, and the antimicrobial activity was measured against [Staphylococcus epidermidis; Staphylococcus aureus; Proteus spp.; Klebsiella spp.; Escherichia coli; Candida albicans] as tester strains. The total phenolic content of Avena sativa and Ocimum basilicum extracts revealed that the
... Show MoreThe traveling salesman problem (TSP) is a well-known and important combinatorial optimization problem. The goal is to ï¬nd the shortest tour that visits each city in a given list exactly once and then returns to the starting city. In this paper we exploit the TSP to evaluate the minimum total cost (distance or time) for Iraqi cities. So two main methods are investigated to solve this problem; these methods are; Dynamic Programming (DP) and Branch and Bound Technique (BABT). For the BABT, more than one lower and upper bounds are be derived to gain the best one. The results of BABT are completely identical to DP, with less time for number of cities (n), 5 ≤ n ≤ 25. These results proof the efficiency of BABT compared with so
... Show More