Within this research, The problem of scheduling jobs on a single machine is the subject of study to minimize the multi-criteria and multi-objective functions. The first problem, minimizing the multi-criteria, which include Total Completion Time, Total Late Work, and Maximum Earliness Time (∑𝐶𝑗, ∑𝑉𝑗, 𝐸𝑚𝑎𝑥), and the second problem, minimizing the multi-objective functions ∑𝐶𝑗 + ∑𝑉𝑗 +𝐸𝑚𝑎𝑥 are the problems at hand in this paper. In this study, a mathematical model is created to address the research problems, and some rules provide efficient (optimal) solutions to these problems. It has also been proven that each optimal solution for ∑𝐶𝑗 + ∑𝑉𝑗 + 𝐸𝑚𝑎𝑥 is an efficient solution to the problem (∑𝐶𝑗, ∑𝑉𝑗, 𝐸𝑚𝑎𝑥). Because these problems are NP-hard problems so it is difficult to determine the efficient (optimal) solution set for these problems so some special cases are shown and proven which find some efficient (optimal) solutions suitable for the discussed problem, and highlight the significance of the Dominance Rule (DR), which can be applied to this problem to enhance efficient solutions.
In this research, we discussed bone density for women taking into consideration the method of research, we measure the total body mass of women in premenopausal and comparing it with postmenopausal, since the amount of the bone mineral content and bone mineral density, fat mass and lean mass.
A cross sectional study conducted at DXA laboratory, Physiology Department, College of Medicine, University of Ninevah, Mosul-Iraq from Jan. 1 - Dec. 31, 2013. Since 174 healthy women recruited from reviewing of college medical academic center. They were divided into two groups: pre menopause group (n = 42) and post menopause group (n= 130). Detailed anthropometric data were gathered from study subjects. The mean age SD of pre-menopause group was
The main focus of this research is to examine the Travelling Salesman Problem (TSP) and the methods used to solve this problem where this problem is considered as one of the combinatorial optimization problems which met wide publicity and attention from the researches for to it's simple formulation and important applications and engagement to the rest of combinatorial problems , which is based on finding the optimal path through known number of cities where the salesman visits each city only once before returning to the city of departure n this research , the benefits of( FMOLP) algorithm is employed as one of the best methods to solve the (TSP) problem and the application of the algorithm in conjun
... Show MoreIn this work, we introduce Fibonacci– Halpern iterative scheme ( FH scheme) in partial ordered Banach space (POB space) for monotone total asymptotically non-expansive mapping (, MTAN mapping) that defined on weakly compact convex subset. We also discuss the results of weak and strong convergence for this scheme.
Throughout this work, compactness condition of m-th iterate of the mapping for some natural m is necessary to ensure strong convergence, while Opial's condition has been employed to show weak convergence. Stability of FH scheme is also studied. A numerical comparison is provided by an example to show that FH scheme is faster than Mann and Halpern iterative
... Show Moreproblems with its unobvious effect on scientific creativity and information. Problem solving is one of main goals of researchers because it develops their right logical thinking methods. The present study aims at measuring logical thinking among female it structures in the university mea swing problem solving among them ,identifying statically differences significance in logical thinking among female instructors in the university according to (Specialization Variable), identifying differences significance in problem Solving among female instructions in the university according to ( Specialization Variable) and identifying the Correlation between logical thinking and problem solving among female instructors in the university. The sample c
... Show MoreIn this article, the nonlinear problem of Jeffery-Hamel flow has been solved analytically and numerically by using reliable iterative and numerical methods. The approximate solutions obtained by using the Daftardar-Jafari method namely (DJM), Temimi-Ansari method namely (TAM) and Banach contraction method namely (BCM). The obtained solutions are discussed numerically, in comparison with other numerical solutions obtained from the fourth order Runge-Kutta (RK4), Euler and previous analytic methods available in literature. In addition, the convergence of the proposed methods is given based on the Banach fixed point theorem. The results reveal that the presented methods are reliable, effective and applicable to solve other nonlinear problems.
... Show MoreIn this paper we will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM).
The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5≤ n ≤500, where n is the number of visited cities.
Transport is a problem and one of the most important mathematical methods that help in making the right decision for the transfer of goods from sources of supply to demand centers and the lowest possible costs, In this research, the mathematical model of the three-dimensional transport problem in which the transport of goods is not homogeneous was constructed. The simplex programming method was used to solve the problem of transporting the three food products (rice, oil, paste) from warehouses to the student areas in Baghdad, This model proved its efficiency in reducing the total transport costs of the three products. After the model was solved in (Winqsb) program, the results showed that the total cost of transportation is (269,
... Show MoreIn this paper we present a new method for solving fully fuzzy multi-objective linear programming problems and find the fuzzy optimal solution of it. Numerical examples are provided to illustrate the method.
Histidine was determined via measurement of total luminescence (i:e creation of chemiluminescence and insitu irradiation of released light to an acceptor fluorophore molecule to initiate fluorescence from fluorescien molecule in flat – spiral micro cell designed for this measurement . A detailed description of robust linear equation for the range of 0.002 – 0.05 mol.L-1 for a sample size of 70 µL with a correlation coefficient of 0.9879 and a coefficient of determination of 97.59% while for a quadratic model of the same concentration range was 0.9881 correlation coefficient and 97.63% coefficient of determination. Analysis of variance was conducted for both kinds of models . It indicated that their was no significa
... Show More