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)
The invention relates to a coordinate measuring machine (CMM) for determining a measuring position of a probe. The AACMM isdepends on the robotkinematics (forward and reverse) in their measurementprinciple, i.e., using the AACMM links and joint angles todetermine the exact workspace or part coordinates. Hence, themeasurements are obtained using an AACMM will be extremely accurate and precise since that ismerely dependent on rigid structural parameters and the only source of measurement error is due to human operators. In this paper, a new AACMM design was proposed. The new AACMM design addresses common issues such as solving the complex kinematics, overcoming the workspace limitation, avoiding singularity, and eliminating the effects of
... Show MoreThis study is qualitative, it illustrates H.G. Wells\\'s The Time Machine through the scientific and social framework of the Victorian Era. Wells\\'s portrayal of future societies examines the rapid technological progress and social changes of the 19th century. The analysis scrutinizes the division between the Eloi and the Morlocks, tracing the consequences of social division. To meet the objective of the study, Victorian frame of mind is utilized to examine the class struggle that is symbolized by the Eloi and the Morlocks. The analysis highlights the economic and social effects of industrialization and how Wells examines the capitalist system and its impact on human relationships and class division. The study also utilizes concepts from D
... Show MoreThis paper studies a novel technique based on the use of two effective methods like modified Laplace- variational method (MLVIM) and a new Variational method (MVIM)to solve PDEs with variable coefficients. The current modification for the (MLVIM) is based on coupling of the Variational method (VIM) and Laplace- method (LT). In our proposal there is no need to calculate Lagrange multiplier. We applied Laplace method to the problem .Furthermore, the nonlinear terms for this problem is solved using homotopy method (HPM). Some examples are taken to compare results between two methods and to verify the reliability of our present methods.
In this paper Volterra Runge-Kutta methods which include: method of order two and four will be applied to general nonlinear Volterra integral equations of the second kind. Moreover we study the convergent of the algorithms of Volterra Runge-Kutta methods. Finally, programs for each method are written in MATLAB language and a comparison between the two types has been made depending on the least square errors.
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 doxorubicin (15 mg/kg); Group VII: Pyridoxine (10 mg/kg) prior to doxorubicin (15 mg/kg); Group VIII: Pyridoxine (15 mg/kg) prior to doxorub
... Show More