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, we consider a new approach to solve type of partial differential equation by using coupled Laplace transformation with decomposition method to find the exact solution for non–linear non–homogenous equation with initial conditions. The reliability for suggested approach illustrated by solving model equations such as second order linear and nonlinear Klein–Gordon equation. The application results show the efficiency and ability for suggested approach.
The main object of this study is to solve a system of nonlinear ordinary differential equations (ODE) of the first order governing the epidemic model using numerical methods. The application under study is a mathematical epidemic model which is the influenza model at Australia in 1919. Runge-kutta methods of order 4 and of order 45 for solving this initial value problem(IVP) problem have been used. Finally, the results obtained have been discussed tabularly and graphically.
The behaviour of certain dynamical nonlinear systems are described in term as chaos, i.e., systems' variables change with the time, displaying very sensitivity to initial conditions of chaotic dynamics. In this paper, we study archetype systems of ordinary differential equations in two-dimensional phase spaces of the Rössler model. A system displays continuous time chaos and is explained by three coupled nonlinear differential equations. We study its characteristics and determine the control parameters that lead to different behavior of the system output, periodic, quasi-periodic and chaos. The time series, attractor, Fast Fourier Transformation and bifurcation diagram for different values have been described.
Metronidazole-MIPs were prepared by using (MDZ) as the template as well as allylchloride (AYC) or allylbromide (AYB) as monomer, used (TMPTA) tri-methylol propane tri-acrylate or ethylene glycol di-methyl acrylate (EGDMA) as cross-linker and initiator used (BP) benzyl peroxide. By using different plasticizers (di butyl Phthalate (DBPH), Nitrobenzene (NB), oleic acid (OA) and paraffin) for MDZ-MIP1 and (Di-butyl sebecate (DBS), Di-methyl acrylate (DMA), Tributylphosphate(TBP) and Tris(ethylhexyl phosphate (TEHP) ) for MDZ-MIP2. Membranes of MIPs were prepared in PVC matrix. The characterizations of each electrode were determined The Slope range from (55.083 - 43.711) mV/decade, Limit of Detection (8 X 10 -4- 2 X 10-6) and Linearity
... Show MoreThe research aimed to explore the recall habits and developing the right recall habits at middle school students. A sample of (40) students were chosen intentionally from middle school students in two schools (almntzr- zany aleabdyn) with an average of (20) students from each school. They were evenly distributed in two experimental and control groups. To achieve the aims of the research, a scale was designed to measure the recall habits, and a preparation of an educational program to develop recall habits.
To process data statistically, the researcher used several statistical methods such as Pearson correlation coefficient, chi-square, T-test for one sample, T-test for two independent samples, Wilcoxon test, Mann-Whitney test, ET
... Show MoreThe paper is concerned with the state and proof of the existence theorem of a unique solution (state vector) of couple nonlinear hyperbolic equations (CNLHEQS) via the Galerkin method (GM) with the Aubin theorem. When the continuous classical boundary control vector (CCBCV) is known, the theorem of existence a CCBOCV with equality and inequality state vector constraints (EIESVC) is stated and proved, the existence theorem of a unique solution of the adjoint couple equations (ADCEQS) associated with the state equations is studied. The Frcéhet derivative derivation of the "Hamiltonian" is obtained. Finally the necessary theorem (necessary conditions "NCs") and the sufficient theorem (sufficient conditions" SCs") for optimality of the stat
... Show MoreCommunity detection is useful for better understanding the structure of complex networks. It aids in the extraction of the required information from such networks and has a vital role in different fields that range from healthcare to regional geography, economics, human interactions, and mobility. The method for detecting the structure of communities involves the partitioning of complex networks into groups of nodes, with extensive connections within community and sparse connections with other communities. In the literature, two main measures, namely the Modularity (Q) and Normalized Mutual Information (NMI) have been used for evaluating the validation and quality of the detected community structures. Although many optimization algo
... Show More