In this paper, one of the Machine Scheduling Problems is studied, which is the problem of scheduling a number of products (n-jobs) on one (single) machine with the multi-criteria objective function. These functions are (completion time, the tardiness, the earliness, and the late work) which formulated as . The branch and bound (BAB) method are used as the main method for solving the problem, where four upper bounds and one lower bound are proposed and a number of dominance rules are considered to reduce the number of branches in the search tree. The genetic algorithm (GA) and the particle swarm optimization (PSO) are used to obtain two of the upper bounds. The computational results are calculated by coding (progr

In this work, we first construct Hermite wavelets on the interval [0,1) with it’s product, Operational matrix of integration 2^k M×2^k M is derived, and used it for solving nonlinear Variational problems with reduced it to a system of algebric equations and aid of direct method. Finally, some examples are given to illustrate the efficiency and performance of presented method.

 The aim of this paper is to present a semi - analytic technique for solving singular initial value problems of ordinary differential equations with a singularity of different kinds to construct polynomial solution using two point  osculatory  interpolation.           The efficiency and accuracy of suggested method is assessed by comparisons with exact and other approximate solutions for a wide classes of non–homogeneous, non–linear singular initial value problems.             A new, efficient estimate of the global error is used for adaptive mesh selection. Also, analyze some of the numerical aspects

This paper is concerned with finding the approximation solution (APPS) of a certain type of nonlinear hyperbolic boundary value problem (NOLHYBVP).  The given BVP is written in its discrete (DI) weak form (WEF), and is proved that  it has a unique APPS, which is obtained via the mixed Galerkin finite element method (GFE) with implicit method (MGFEIM) that reduces the problem to solve the Galerkin nonlinear algebraic system  (GNAS).  In this part, the predictor and the corrector technique (PT and CT) are proved convergent and are used to transform the obtained GNAS to  linear (GLAS ), then the GLAS is solved using the Cholesky method (ChMe). The stability and the convergence of the method are studied. The results

The aim of this paper, is to design multilayer Feed Forward Neural Network(FFNN)to find the approximate solution of the second order linear Volterraintegro-differential equations with boundary conditions. The designer utilized to reduce the computation of solution, computationally attractive, and the applications are demonstrated through illustrative examples.

In this paper, we present an approximate analytical and numerical solutions for the differential equations with multiple delay using the extend differential transform method (DTM). This method is used to solve many linear and non linear problems.

This study presents the execution of an iterative technique suggested by Temimi and Ansari (TA) method to approximate solutions to a boundary value problem of a 4th-order nonlinear integro-differential equation (4th-ONIDE) of the type Kirchhoff which appears in the study of transverse vibration of hinged shafts. This problem is difficult to solve because there is a non-linear term under the integral sign, however, a number of authors have suggested iterative methods for solving this type of equation. The solution is obtained as a series that merges with the exact solution. Two examples are solved by TA method, the results showed that the proposed technique was effective, accurate, and reliable. Also, for greater reliability, the approxim

     Meerkat Clan Algorithm (MCA) is a nature-based metaheuristic algorithm which imitates the intelligent behavior of the meerkat animal. This paper presents an improvement on the MCA based on a chaotic map and crossover strategy (MCA-CC). These two strategies increase the diversification and intensification of the proposed algorithm and boost the searching ability to find more quality solutions. The 0-1 knapsack problem was solved by the basic MCA and the improved version of this algorithm (MCA-CC). The performance of these algorithms was tested on low and high dimensional problems. The experimental results demonstrate that the proposed algorithm had overcome the basic algorithm in terms of solution quality, speed a

     In this paper, we design a fuzzy neural network to solve fuzzy singularly perturbed Volterra integro-differential equation by using a High Performance Training Algorithm such as the Levenberge-Marqaurdt (TrianLM) and the sigmoid function of the hidden units which is the hyperbolic tangent activation function. A fuzzy trial solution to fuzzy singularly perturbed Volterra integro-differential equation is written as a sum of two components. The first component meets the fuzzy requirements, however, it does not have any fuzzy adjustable parameters. The second component is a feed-forward fuzzy neural network with fuzzy adjustable parameters. The proposed method is compared with the analytical solutions. We find that the proposed meth