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

The main purpose of this paper is to introduce a some concepts in fibrewise bitopological spaces which are called fibrewise , fibrewise -closed, fibrewise −compact, fibrewise -perfect, fibrewise weakly -closed, fibrewise almost -perfect, fibrewise ∗-bitopological space respectively. In addition the concepts as - contact point, ij-adherent point, filter, filter base, ij-converges to a subset, ij-directed toward a set, -continuous, -closed functions, -rigid set, -continuous functions, weakly ijclosed, ij-H-set, almost ij-perfect, ∗-continuous, pairwise Urysohn space, locally ij-QHC bitopological space are introduced and the main concept in this paper is fibrewise -perfect bitopological spaces. Several theorems and characterizations c

                  The research aims to present a proposed strategy for the North Oil Company, and the proposed strategy took into account the surrounding environmental conditions and adopted in its formulation on the basis and scientific steps that are comprehensive and realistic, as it covered the main activities of the company (production and exploration activities, refining and refining activities, export and transport of oil, research and development activity, financial activity, information technology, human resources) and the (David) model has been adopted in the environmental analysis of the factors that have been diagnosed according to a

This paper is concerned with introducing and studying the M-space by using the mixed degree systems which are the core concept in this paper. The necessary and sufficient condition for the equivalence of two reflexive M-spaces is super imposed. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are introduced. From an M-space, a unique supratopological space is introduced. Furthermore, the m-continuous (m-open and m-closed) functions are defined and the fundamental theorem of the m-continuity is provided. Finally, the m-homeomorphism is defined and some of its properties are investigated.

يهدف البحث الى تقديم استراتيجية مقترحة لشركة نفط الشمال ، وأخذت الاستراتيجية المقترحة بنظر الاعتبار الظروف البيئية المحيطة واعتمدت في صياغتها على اسس وخطوات علمية تتسم بالشمولية والواقعية ، اذ انها غطت الانشطة الرئيسية في الشركة (نشاط الانتاج والاستكشاف , نشاط التكرير والتصفية , التصدير ونقل النفط , نشاط البحث والتطوير , النشاط المالي , تقنية المعلومات , الموارد البشرية ) وقد اعتمد نموذج (David) في التحليل البيئي

            The article describes a certain computation method of -arcs to construct the number of distinct -arcs in  for . In this method, a new approach employed to compute the number of -arcs and the number of distinct arcs respectively. This approach is based on choosing the number of inequivalent classes } of -secant distributions that is the number of 4-secant, 3-secant, 2-secant, 1-secant and 0-secant in each process. The maximum size of -arc that has been constructed by this method is . The new method is a new tool to deal with the programming difficulties that sometimes may lead to programming problems represented by the increasing number of arcs. It is essential to reduce the established number of -arcs in each cons

Abstract

Much attention has been paid for the use of robot arm in various applications. Therefore, the optimal path finding has a significant role to upgrade and guide the arm movement. The essential function of path planning is to create a path that satisfies the aims of motion including, averting obstacles collision, reducing time interval, decreasing the path traveling cost and satisfying the kinematics constraints. In this paper, the free Cartesian space map of 2-DOF arm is constructed to attain the joints variable at each point without collision. The D*algorithm and Euclidean distance are applied to obtain the exact and estimated distances to the goal respectively. The modified Particle Swarm Optimization al

A new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducte

The importance of research and study of classical Persian literature is not overlooked.  So far, there have been many studies in this area.  But there are still some things that need more research.  Persian grammar is one of the most important branches of Persian literature.  This section has always been converted at different times.  One of the issues that has been neglected in the studies of classical literature is the study of the technical tales of past and past poetry.  These texts can be studied from different perspectives.  Because Persian is a mixed language, it is possible to combine language terms with each other or to add prefixes and suffixes to express new concepts. They can be used by exam

           This paper introduce two types of edge degrees (line degree and near line degree) and total edge degrees (total line degree and total near line degree) of an edge in a fuzzy semigraph, where a fuzzy semigraph is defined as (V, σ, μ, η) defined on a semigraph G^* in which σ : V → [0, 1], μ : VxV → [0, 1] and η : X → [0, 1] satisfy the conditions that for all the vertices u, v in the vertex set,  μ(u, v) ≤ σ(u) ᴧ σ(v) and  η(e) = μ(u₁, u₂) ᴧ μ(u₂, u₃) ᴧ … ᴧ μ(u_n-1, u_n) ≤ σ(u₁) ᴧ σ(u_n), if e = (u₁, u₂, …, u_n), n ≥ 2 is an edge in the semigraph G