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)
In this paper, several types of space-time fractional partial differential equations has been solved by using most of special double linear integral transform â€double Sumudu â€. Also, we are going to argue the truth of these solutions by another analytically method “invariant subspace methodâ€. All results are illustrative numerically and graphically.
Total Quality Assurance Concept have appeared in Higher Education Institutions as a result of the continuous criticism for the lower quality of the outputs of these institutions and their inappropriacy to the needs of the job market. The faculty, i.e. teaching staff member, is one of the most important output for his/her responsibility to achieve the stated goals in higher education. This represents a problem that may influence the construction of society which has to limit his tasks, responsibilities, and competencies that should be found in a faculty, and evaluating his teaching profession in light of the prerequisites of the century to become an input to achieve quality assurance in Higher Education. Therefore, the present study aims
... Show MoreIn this paper we shall generalize fifth explicit Runge-Kutta Feldberg(ERKF(5)) and Continuous explicit Runge-Kutta (CERK) method using shooting method to solve second order boundary value problem which can be reduced to order one.These methods we shall call them as shooting Continuous Explicit Runge-Kutta method, the results are computed using matlab program.
Abstract
The research aims to study the problem of high production costs and low quality and the use of total quality management tools to detect problems of the high cost of failure and low quality products, diagnosis, and developing appropriate solutions.
To achieve the goal, we studied the overall quality tools and its relationship with the costs and the possibility of improving quality through the use of these tools.
Was limited to these tools and study the relation to the reduction of costs and improving quality have been studied serially by the possibility of the reduction.
To achieve the goal, the study of the concept of total quality management
The present study aimed to evaluate the levels of total immunoglobulin E and percentage count of eosinophil in some of allergic disease. Blood sample collected from 210 patients (110 female, 100 male) with allergic disease (allergic asthma, allergic rhinitis, and urticaria) their age between 10-70 years and 50 healthy control their age between 23-52 years. A highly significant (P<0.01) increase in the mean serum total IgE in patients with asthma (503.54 ± 63.49 IU/ml), Allergic rhinitis (442.77 ± 95.76 IU/ml) and urticaria (489.53 ± 69.68 IU/ml) as a compared with healthy controls (23.67 ± 5.81 IU/ml).There was a significant difference in percentage count of eosinophil in patients groups allergic asthma 4.37 ± 0.52% ,allergic rhinitis
... Show MoreNarcissus tazetta, a member of the Amaryllidaceae family, is known to be rich in bioactive metabolites such as alkaloids, phenolics and flavonoids, which have been found in nearly every species in this family. N. tazetta cultivated in Iraq, had not previously been studied for its active components; thus, the current study used phytochemical screening and phenolic compounds estimation, both qualitatively and quantitatively. Results showed that the plant alcoholic extract was rich in alkaloids, polyphenols and flavonoids besides tannins, polysaccharides and saponins. Qualitatively; TLC and HPLC chromatogram for total phenolics and flavonoids compounds revealed the presence of Gallic acid (GA), Caffeic acid (CA), Paracumar
... Show MoreConsider a simple graph on vertices and edges together with a total labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say defined by for all where Also, the value is said to be the edge weight of . The total edge irregularity strength of the graph G is indicated by and is the least for which G admits edge irregular h-labeling. In this article, for some common graph families are examined. In addition, an open problem is solved affirmatively.