The emphasis of Master Production Scheduling (MPS) or tactic planning is on time and spatial disintegration of the cumulative planning targets and forecasts, along with the provision and forecast of the required resources. This procedure eventually becomes considerably difficult and slow as the number of resources, products and periods considered increases. A number of studies have been carried out to understand these impediments and formulate algorithms to optimise the production planning problem, or more specifically the master production scheduling (MPS) problem. These algorithms include an Evolutionary Algorithm called Genetic Algorithm, a Swarm Intelligence methodology called Gravitational Search Algorithm (GSA), Bat Algorithm (BAT), T

This work is concerned with studying the optimal classical continuous control quaternary vector problem. It is consisted of; the quaternary nonlinear hyperbolic boundary value problem and the cost functional. At first, the weak form of the quaternary nonlinear hyperbolic boundary value problem is obtained. Then under suitable hypotheses, the existence theorem of a unique state quaternary vector solution for the weak form where the classical continuous control quaternary vector is considered known is stated and demonstrated by employing the method of Galerkin and the compactness theorem. In addition, the continuity operator between the state quaternary vector solution of the weak form and the corresponding classical continuous control qua

     The aim of this paper is to study the nonlinear delay second order eigenvalue problems which consists of delay ordinary differential equations, in fact one of the expansion methods that is called the least square method which will be developed to solve this kind of problems.

In the past two decades, maritime transport traffic has increased, especially in the case of container flow. The BAP (Berth Allocation Problem) (BAP) is a main problem to optimize the port terminals. The current manuscript explains the DBAP problems in a typical arrangement that varies from the conventional separate design station, where each berth can simultaneously accommodate several ships when their entire length is less or equal to length. Be a pier, serve. This problem was then solved by crossing the Red Colobuses Monkey Optimization (RCM) with the Genetic Algorithm (GA). In conclusion, the comparison and the computational experiments are approached to demonstrate the effectiveness of the proposed method contrasted with other

In this paper, two of the local search algorithms are used (genetic algorithm and particle swarm optimization), in scheduling number of products (n jobs) on a single machine to minimize a multi-objective function which is denoted as  (total completion time, total tardiness, total earliness and the total late work). A branch and bound (BAB) method is used for comparing the results for (n) jobs starting from (5-18). The results show that the two algorithms have found the optimal and near optimal solutions in an appropriate times.

Multi-nationalities companies are the main companies in the progressed
countries that improve the current technology and, thus, become the main source of it.
These companies, in the first place, aim to increase the profits of its
investments to satisfy stock holders in the original countries to which these companies
belong.
It is a mean to interfere in the economic of countries especially the growing
ones and exploit their important natural resources. Since this research focus on the
dangers of these companies, mechanism of its work and its dangers on the most
important natural resources of our country which is oil; therefore, the research
confirm that this important natural treasure must be under an Iraqi cont

   In this work, a novel technique to obtain an accurate solutions to nonlinear form by multi-step combination with Laplace-variational approach (MSLVIM) is introduced. Compared with the  traditional approach for variational it overcome all difficulties and enable to provide us more an accurate solutions with extended of the convergence region as well as covering to larger intervals which providing us a continuous representation of approximate analytic solution and it give more better information of the solution over the whole time interval. This technique is more easier for obtaining the general Lagrange multiplier with reduces the time and calculations. It converges rapidly to exact formula with simply computable terms wit