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)
Abstract
Suffering the human because of pressure normal life of exposure to several types of heart disease as a result of due to different factors. Therefore, and in order to find out the case of a death whether or not, are to be modeled using binary logistic regression model
In this research used, one of the most important models of nonlinear regression models extensive use in the modeling of applications statistical, in terms of heart disease which is the binary logistic regression model. and then estimating the parameters of this model using the statistical estimation methods, another problem will be appears in estimating its parameters, as well as when the numbe
... Show MoreBackground: The present study was carried out to compare shear bond strength of sapphire bracket bonded to zirconium surface after using different methods of surface conditioning and assessment of the adhesive remnant index. Materials and methods: The sample composed of 40 zirconium specimens divided into four groups; the first group was the control, the second group was conditioned by sandblast with aluminum oxide particle 50 μm, the third and fourth group was treated by (Nd: YAG) laser (1064nm)(0.888 Watt for 5 seconds) for the 1st laser group and (0.444 Watt for 10 seconds) for the 2nd laser group. All samples were coated by z-prime plus primer. A central incisor sapphire bracket was bonded to all samples with light cure adhesive res
... Show MoreDue to its importance in physics and applied mathematics, the non-linear Sturm-Liouville problems
witnessed massive attention since 1960. A powerful Mathematical technique called the Newton-Kantorovich
method is applied in this work to one of the non-linear Sturm-Liouville problems. To the best of the authors’
knowledge, this technique of Newton-Kantorovich has never been applied before to solve the non-linear
Sturm-Liouville problems under consideration. Accordingly, the purpose of this work is to show that this
important specific kind of non-linear Sturm-Liouville differential equations problems can be solved by
applying the well-known Newton-Kantorovich method. Also, to show the efficiency of appl
This paper presents new modification of HPM to solve system of 3 rd order PDEs with initial condition, for finding suitable accurate solutions in a wider domain.
This paper focuses on developing a self-starting numerical approach that can be used for direct integration of higher-order initial value problems of Ordinary Differential Equations. The method is derived from power series approximation with the resulting equations discretized at the selected grid and off-grid points. The method is applied in a block-by-block approach as a numerical integrator of higher-order initial value problems. The basic properties of the block method are investigated to authenticate its performance and then implemented with some tested experiments to validate the accuracy and convergence of the method.
In this paper , an efficient new procedure is proposed to modify third –order iterative method obtained by Rostom and Fuad [Saeed. R. K. and Khthr. F.W. New third –order iterative method for solving nonlinear equations. J. Appl. Sci .7(2011): 916-921] , using three steps based on Newton equation , finite difference method and linear interpolation. Analysis of convergence is given to show the efficiency and the performance of the new method for solving nonlinear equations. The efficiency of the new method is demonstrated by numerical examples.
In this paper generalized spline method is used for solving linear system of fractional integro-differential equation approximately. The suggested method reduces the system to system of linear algebraic equations. Different orders of fractional derivative for test example is given in this paper to show the accuracy and applicability of the presented method.