The aim of this research is to compare traditional and modern methods to obtain the optimal solution using dynamic programming and intelligent algorithms to solve the problems of project management.

It shows the possible ways in which these problems can be addressed, drawing on a schedule of interrelated and sequential activities And clarifies the relationships between the activities to determine the beginning and end of each activity and determine the duration and cost of the total project and estimate the times used by each activity and determine the objectives sought by the project through planning, implementation and monitoring to maintain the budget assessed 

Abstract :

The study aims at building a mathematical model for the aggregate production planning for Baghdad soft drinks company. The study is based on a set of aggregate planning strategies (Control of working hours, storage level control strategy) for the purpose of exploiting the resources and productive capacities available in an optimal manner and minimizing production costs by using (Matlab) program. The most important finding of the research is the importance of exploiting during the available time of production capacity. In the months when the demand is less than the production capacity available for investment. In the subsequent months when the demand exceeds the available energy and to minimize the use of overti

          The present paper studies the generalized Φ-  recurrent of Kenmotsu type manifolds. This is done to determine the components of the covariant derivative of the Riemannian curvature tensor. Moreover, the conditions which make Kenmotsu type manifolds to be locally symmetric or generalized Φ- recurrent have been established. It is also concluded that the locally symmetric of Kenmotsu type manifolds are generalized recurrent under suitable condition and vice versa. Furthermore, the study establishes the relationship between the Einstein manifolds and locally symmetric of Kenmotsu type manifolds.

In this paper, new concepts which are called: left derivations and generalized left derivations in nearrings have been defined. Furthermore, the commutativity of the 3-prime near-ring which involves some
algebraic identities on generalized left derivation has been studied.

The Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.

Cryptography is the process of transforming message to avoid an unauthorized access of data. One of the main problems and an important part in cryptography with secret key algorithms is key. For higher level of secure communication key plays an important role. For increasing the level of security in any communication, both parties must have a copy of the secret key which, unfortunately, is not that easy to achieve. Triple Data Encryption Standard algorithm is weak due to its weak key generation, so that key must be reconfigured to make this algorithm more secure, effective, and strong. Encryption key enhances the Triple Data Encryption Standard algorithm securities. This paper proposed a combination of two efficient encryption algorithms to