This study presents the multi criteria single-machine model. The machine scheduling problem (MSP) for ntasks on a single machine involves minimizing a function of three criteria: total completion time (C_j),maximum earliest (E_max), and tardiness (〖ΣT〗_j), This is an NP-hard issue. Within this work's theoretical section, we present the mathematical formulation of The presented topic thenhighlights the usefulness of the dominance rule (DR), which may be used to develop effective solutions. Whilein the practical part, one of the important exact methods; The proposed MSP tricriteria are solved by applyingthe Branch and Bound (BAB) method, which finds a set of efficient solutions for 1//F(ΣC_j ,ΣT_j ,E_max) upto n=100 jobs. The BAB appro

Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in  is either a pendent vertex or a support vertex and  has a perfect matching. The minimum cardinality of a complementary perfect corona dominating set is called the complementary perfect corona domination number and is denoted by . In this paper, our parameter hasbeen discussed for power graphs of path and cycle.

The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i

An improved Metal Solar Wall (MSW) with integrated thermal energy storage is presented in this research. The proposed MSW makes use of two, combined, enhanced heat transfer methods. One of the methods is characterized by filling the tested ducts with a commercially available copper Wired Inserts (WI), while the other one uses dimpled or sinusoidal shaped duct walls instead of plane walls. Ducts having square or semi-circular cross sectional areas are tested in this work.
A developed numerical model for simulating the transported thermal energy in MSW is solved by finite difference method. The model is described by system of three governing energy equations. An experimental test rig has been built and six new duct configurations have b

A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.

To decrease the dependency of producing high octane number gasoline on the catalytic processes in petroleum refineries and to increase the gasoline pool, the effect of adding a suggested formula of composite blending octane number enhancer to motor gasoline composed of a mixture of oxygenated materials (ethanol and ether) and aromatic materials (toluene and xylene) was investigated by design of experiments made by Mini Tab 15 statistical software. The original gasoline before addition of the octane number blending enhancer has a value of (79) research octane number (RON). The design of experiments which study the optimum volumetric percentages of the four variables, ethanol, toluene, and ether and xylene materials leads

The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations. One of some concepts in graph theory that combine these two concepts is resolving dominating number. In this paper, the definition of resolving dominating number is presented again as the term dominant metric dimension. The aims of this paper are to find the dominant metric dimension of some special graphs and corona product graphs of the connected graphs  and , for some special graphs  . The dominant metric dimension of  is denoted by  and the dominant metric dimension of corona product graph G and H is denoted by .

In this research, the focus was placed on estimating the parameters of the Hypoexponential distribution function using the maximum likelihood method and genetic algorithm. More than one standard, including MSE, has been adopted for comparison by Using the simulation method