The fuzzy assignment models (FAMs) have been explored by various literature to access classical values, which are more precise in our real-life accomplishment. The novelty of this paper contributed positively to a unique application of pentagonal fuzzy numbers for the evaluation of FAMs. The new method namely Pascal’s triangle graded mean (PT-GM) has presented a new algorithm in accessing the critical path to solve the assignment problems (AP) based on the fuzzy objective function of minimising total cost. The results obtained have been compared to the existing methods such as, the centroid formula (CF) and centroid formula integration (CFI). It has been demonstrated that operational efficiency of this conducted method is exquisitely deve

    Crow Search Algorithm (CSA) can be defined as one of the new swarm intelligence algorithms that has been developed lately, simulating the behavior of a crow in a storage place and the retrieval of the additional food when required. In the theory of the optimization, a crow represents a searcher, the surrounding environment represents the search space, and the random storage of food location represents a feasible solution. Amongst all the food locations, the one where the maximum amount of the food is stored is considered as the global optimum solution, and objective function represents the food amount. Through the simulation of crows’ intelligent behavior, the CSA attempts to find the optimum solutions to a variety of the proble

Transport is a problem and one of the most important mathematical methods that help in making the right decision for the transfer of goods from sources of supply to demand centers and the lowest possible costs, In this research, the mathematical model of the three-dimensional transport problem in which the transport of goods is not homogeneous was constructed. The simplex programming method was used to solve the problem of transporting the three food products (rice, oil, paste) from warehouses to the student areas in Baghdad, This model proved its efficiency in reducing the total transport costs of the three products. After the model was solved in (Winqsb) program, the results showed that the total cost of transportation is (269,

The method of operational matrices based on different types of polynomials such as Bernstein, shifted Legendre and Bernoulli polynomials will be presented and implemented to solve the nonlinear Blasius equations approximately. The nonlinear differential equation will be converted into a system of nonlinear algebraic equations that can be solved using Mathematica^®12. The efficiency of these methods has been studied by calculating the maximum error remainder ( ), and it was found that their efficiency increases as the polynomial degree (n) increases, since the errors decrease. Moreover, the approximate solutions obtained by the proposed methods are compared with the solution of the 4^th order Runge-Kutta meth

      In this research, a variable stiffness actuator is proposed to enhance the damping of the mechanical vibrating system. The frequency response analysis of the vibrating system is dependant in order to analyze and synthesis this semi-active damping, where the suggested process is using active filter to estimate the present frequency of the vibration system, and this will limit the value of the stiffness of the vibrated system. Two active filter s are needed, low-pass-filter (LPF) to choose the higher stiffness of the actuator at small frequencies as well as more damping and high-pass-filter (HPF) to choose the lower stiffness of the actuator at high frequencies as well as more damping, and so

Throughout this paper R represents commutative ring with identity, and M is a unitary left R-module. The purpose of this paper is to study a new concept, (up to our knowledge), named a semi-extending modules, as generalization of extending modules, where an Rmodule M is called semi-extending if every sub module of M is a semi-essential in a direct summand of M. Various properties of semi-extending module are considered. Moreover, we investigate the relationships between semi-extending modules and other related concepts, such as CLS-modules and FI- extending modules.

    In this paper, we studied the scheduling of  jobs on a single machine.  Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completi

Let  be a commutative ring with 1 and  be a left unitary . In this paper, the generalizations for the notions of compressible module and  retractable module are given.

An   is termed to be  semi-essentially compressible if   can be embedded in every of a non-zero semi-essential submodules. An  is termed a semi-essentially retractable module, if   for every non-zero semi-essentially submodule of an . Some of their advantages characterizations and examples are given.  We also study the relation between these classes and some other classes of modules.

Let  be a commutative ring with 1 and  be left unitary  . In this paper we introduced and studied concept of semi-small compressible module (a     is said to be semi-small compressible module if  can be embedded in every nonzero semi-small submodule of . Equivalently,  is  semi-small compressible module if there exists a monomorphism  , ,     is said to be semi-small retractable module if  , for every non-zero  semi-small sub module in . Equivalently,  is semi-small retractable if there exists a homomorphism  whenever  .     In this paper we introduce and study the concept of semi-small compressible and semi-small retractable s as a generalization of compressible  and retractable  respectively and give some of their adv