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)
Support vector machines (SVMs) are supervised learning models that analyze data for classification or regression. For classification, SVM is widely used by selecting an optimal hyperplane that separates two classes. SVM has very good accuracy and extremally robust comparing with some other classification methods such as logistics linear regression, random forest, k-nearest neighbor and naïve model. However, working with large datasets can cause many problems such as time-consuming and inefficient results. In this paper, the SVM has been modified by using a stochastic Gradient descent process. The modified method, stochastic gradient descent SVM (SGD-SVM), checked by using two simulation datasets. Since the classification of different ca
... Show MoreAbstract
At any moment, the continuous usage of medications can accompanied by DNA damage and the accumulation of such damages can cause serious consequences. Antidepressants are long-term used drugs and the incidence of their genotoxic impacts cannot be excluded. Therefore, this work was designed to investigate the possible genotoxic effects of the commonly used antidepressants (fluoxetine and amitriptyline) in adult male rats.
Detection of DNA damage in individual cells was assessed by comet and micronucleus assays in three different cell populations i.e. liver, testis and bone marrow tissues of 24 swiss albino adult male rats. The animals were randomly allocated into three groups of 8 rats ea
... Show MoreThe impact of applying the K-W-L self-scheduling technique on first-year intermediate students' learning of basic volleyball skills, Ayad Ali Hussein*, Israa Fouad Salih
The purpose of this study is to evaluate the hydraulic performance and efficiency of using direction diverting blocks, DDBs, fixed on the surface on an Ogee spillway in reducing the acceleration and dissipating the energy of the incoming supercritical flow. Fifteen types of DDB models were made from wood with a triangulate shape and different sizes were used. Investigation tests on pressure distribution at the DDBs boundaries were curried out to insure there is no negative pressures is developed that cause cavitation. In these tests, thirty six test runs were accomplished by using six types of blocks with the same size but differ in apex angle. Results of these test showed no negative pressures developed at the boundarie
... Show More