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)
Total Electron Content measurements derived from Athens station ionograms (ITEC),
located near Iraq, during the ascending phase of solar cycle 24 (July 2009- April 2010),
according to availability of data, are compared with the latest version of the International
Reference Ionosphere model, IRI-2012 (IRI TEC), using two options (NeQuick, IRI01-
Corr) for topside electron density.
The results obtained from both (ITEC and IRI TEC) techniques were similar, where
correlation coefficients between them are very high. Generally, the IRI predictions
overestimate the ITEC values.
Abstract:
The aim of the current study was to investigate the possible protective effect of graded doses (5, 10, and 15mg/kg) of pyridoxine hydrochloride intraperitoneally injected against (15mg/kg) doxorubicin-induced cardiotoxicity in female rats. Fifty-six (56) Wistar albino female rats were utilized weighing 180-200 gm allocated into eight groups, seven rats each; Group I: negative control distilled water; Group II: Pyridoxine (5mg/kg); Group III: Pyridoxine (10mg/kg); Group IV: Pyridoxine (15mg/kg); Group V: doxorubicin (15 mg/kg); Group VI: Pyridoxine (5 mg/kg) prior to
... Show MoreThe basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition for a membership function to find near interior, near boundary and near exterior vertices. Moreover, proved results, examples and counter examples are provided. The Gm-closure structure which suggested in this paper opens up the way for applying rich amount of topological facts and methods in the process of granular computing.
Irrigation scheduling techniques is one of the suggested solutions for water scarcity problem. The study aims to show the possibility of using practical and applicable irrigation scheduling program which was designed by Water Resources Department at the University of Baghdad by using Spreadsheet Formulas for Microsoft Excel program, version 2007, with some modification to generalize it and made it applicable to various climatic zone and different soil types, as a salvation for the shortage of irrigation water inside the irrigation projects. Irrigation projects which incidence of Tigris River basin will be taken as an applicable example. This program was based on water budgeting and programmed depending on scientific concepts which facili
... Show MoreRecently, Human Activity Recognition (HAR) has been a popular research field due to wide spread of sensor devices. Embedded sensors in smartwatch and smartphone enabled applications to use sensors in activity recognition with challenges for example, support of elderly’s daily life . In the aim of recognizing and analyzing human activity many approaches have been implemented in researches. Most articles published on human activity recognition used a multi -sensors based methods where a number of sensors were tied on different positions on a human body which are not suitable for many users. Currently, a smartphone and smart watch device combine different types of sensors which present a new area for analysi
... Show MoreIn this paper, we present an approximate analytical and numerical solutions for the differential equations with multiple delay using the extend differential transform method (DTM). This method is used to solve many linear and non linear problems.
The main goal of this paper is to make link between the subjects of projective
geometry, vector space and linear codes. The properties of codes and some examples
are shown. Furthermore, we will give some information about the geometrical
structure of the arcs. All these arcs are give rise to an error-correcting code that
corrects the maximum possible number of errors for its length.
The study aimed to investigate the effect of different times as follows 0.5, 1.00, 2.00 and 3.00 hrs, type of solvent (acetone, methanol and ethanol) and temperature (~ 25 and 50)ºc on curcumin percentage yield from turmeric rhizomes. The results showed significant differences (p? 0.05) in all variables. The curcumin content which were determined spectrophotometrically ranged between (0.55-2.90) %. The maximum yield was obtained when temperature, time and solvent were 50ºC, 3 hrs and acetone, respectively.