In this paper, we present a Branch and Bound (B&B) algorithm of scheduling (n) jobs on a single machine to minimize the sum total completion time, total tardiness, total earliness, number of tardy jobs and total late work with unequal release dates. We proposed six heuristic methods for account upper bound. Also to obtain lower bound (LB) to this problem we modified a (LB) select from literature, with (Moore algorithm and Lawler's algorithm).  And some dominance rules were suggested. Also, two special cases were derived. Computational experience showed the proposed (B&B) algorithm was effective in solving problems with up to (16) jobs, also the upper bounds and the lower bound were effective in restr

In this paper, we generalized the principle of Banach contractive to the relative formula and then used this formula to prove that the set valued mapping has a fixed point in a complete partial metric space. We also showed that the set-valued mapping can have a fixed point in a complete partial metric space without satisfying the contraction condition. Additionally, we justified an example for our proof.

We consider some nonlinear partial differential equations in higher dimensions, the negative order of the Calogero-Bogoyavelnskii-Schiff (nCBS) equationin (2+1) dimensions, the combined of the Calogero-Bogoyavelnskii-Schiff equation and the negative order of the Calogero-Bogoyavelnskii-Schiff equation (CBS-nCBS) in (2+1) dimensions, and two models of the negative order Korteweg de Vries (nKdV) equations in (3+1) dimensions. We show that these equations can be reduced to the  same class of ordinary differential equations via wave reduction variable. Solutions in terms of symmetrical Fibonacci and Lucas functions are presented by implementation of the modified Kudryashov method.

Refuse derived fuel (RDF) is considered one of the most important types of low cost thermal energy which can be tapped in the industry, especially the cement industry in particular being the need of high thermal energy during the production processes, and in this paper we have implemented the use of a derivative of the fuel RDF  as a substitute for gasoline , to reduce production costs and thereby achieve production efficiency, and the methodology used in this research statistical analysis as well as the use of the cost of kaizen target for the purpose of reducing costs and achieve production efficiency, and this has reduced the cost total cement production by which led to reduce total costs of cement production by 8.4% and an incre

Unter dem Titel " Technische Methoden im Fremdsprachunterricht als eine neueste Methode im Fremdsprachlernen, die Spiele als Muster"

versteht man, dass die Forschung  sich mit einer neuen Methoden im Fremdsprachunterricht beschäftigt. Von den neuen Methoden im Unterricht sind die Spiele. So man sieht  in den letzten Jahren viele Artikel zum Thema Spiele im Fremdsprschunterricht. Davon gehen wir aus, dass die Spiele im Unterricht eine groβe Rolle spielt, denn diese Methode macht Lust, Spaβ im Lernenprozeβ. Die Spiele im Unterricht bezeichnen als ein Mittel, um Unterricht etwas Schönes , Nützliches und Lebendigs zu sein. Die Spiele sind vielfälltig und unterscheidet sich nach den Themen und Materialien. In dieser F

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 concept of fully pseudo stable Banach Algebra-module (Banach A-module) which is the generalization of fully stable Banach A-module has been introduced. In this paper we study some properties of fully stable Banach A-module and another characterization of fully pseudo stable Banach A-module has been given.

     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 paper we will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM).

The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5≤ n ≤500, where n is the number of visited cities.