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

The 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

The researcher studied transportation problem because it's great importance in the country's economy. This paper which ware studied several ways to find a solution closely to the optimization, has applied these methods to the practical reality by taking one oil derivatives which is benzene product, where the first purpose of this study is, how we can reduce the total costs of transportation for product of petrol from warehouses in the province of Baghdad, to some stations in the Karsh district and Rusafa in the same province. Secondly, how can we address the Domandes of each station by required quantity which is depending on absorptive capacity of the warehouses (quantities supply), And through r

The multiple linear regression model is an important regression model that has attracted many researchers in different fields including applied mathematics, business, medicine, and social sciences , Linear regression models involving a large number of independent variables are poorly performing due to large variation and lead to inaccurate conclusions , One of the most important problems in the regression analysis is the multicollinearity Problem, which is considered one of the most important problems that has become known to many researchers  , As well as their effects on the multiple linear regression model, In addition to multicollinearity, the problem of outliers in data is one of the difficulties in constructing the reg

This paper investigates some exact and local search methods to solve the traveling salesman problem. The Branch and Bound technique (BABT) is proposed, as an exact method, with two models. In addition, the classical Genetic Algorithm (GA) and Simulated Annealing (SA) are discussed and applied as local search methods. To improve the performance of GA we propose two kinds of improvements for GA; the first is called improved GA (IGA) and the second is Hybrid GA (HGA).

The IGA gives best results than GA and SA, while the HGA is the best local search method for all within a reasonable time for 5 ≤ n ≤ 2000, where n is the number of visited cities. An effective method of reducing the size of the TSP matrix was proposed with

Free vibration behavior was developed under the ratio of critical buckling temperature of laminated composite thin plates with the general elastic boundary condition. The equations of motion were found based on classical laminated plate theory (CLPT) while the solution functions consists of trigonometric function and a continuous function that is added to guarantee the sufficient smoother of the so-named remaining displacement function at the boundaries, in this research, a modified Fourier series were used, a generalized procedure solution was developed using Ritz method combined with the imaginary spring technique. The influences of many design parameters such as angles of layers, aspect ratio, thickness ratio, and ratio of initial in-

     In this research, we propose to use two local search methods (LSM's); Particle Swarm Optimization (PSO) and the Bees Algorithm (BA) to solve Multi-Criteria Travelling Salesman Problem (MCTSP) to obtain the best efficient solutions. The generating process of the population of the proposed LSM's may be randomly obtained or by adding some initial solutions obtained from some efficient heuristic methods. The obtained solutions of the PSO and BA are compared with the solutions of the exact methods (complete enumeration and branch and bound methods) and some heuristic methods. The results proved the efficiency of PSO and BA methods for a large number of nodes ( ). The proposed LSM's give the best efficient solutions for the MCTSP for

This paper deals with the continuous classical optimal control problem for triple partial differential equations of parabolic type with initial and boundary conditions; the Galerkin method is used to prove the existence and uniqueness theorem of the state vector solution for given continuous classical control vector. The proof of the existence theorem of a continuous classical optimal control vector associated with the triple linear partial differential equations of parabolic type is given. The derivation of the Fréchet derivative for the cost function is obtained. At the end, the theorem of the necessary conditions for optimality of this problem is stated and is proved.