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 approach finds the efficient solutions for the issue in an acceptable amount of time. Inaddition, we provide two heuristic approaches to address the problem in order to obtain appropriateapproximations. The two proposed approaches' good performance is demonstrated by the practicalexperiments.
Abstract of the research:
This research sheds light on an important phenomenon in our Arabic language, which is linguistic sediments, and by which we mean a group of vocabulary that falls out of use and that native speakers no longer use it, and at the same time it happens that few individuals preserve the phenomenon and use it in their lives, and it is one of the most important phenomena that It should be undertaken and studied by researchers; Because it is at the heart of our huge linguistic heritage, as colloquial Arabic dialects retain a lot of linguistic sediments, and we usually find them at all levels of language: phonetic, banking, grammatical and semantic. In the
... Show MoreThe research is an article that teaches some classes of fully stable Banach - Å modules. By using Unital algebra studies the properties and characterizations of all classes of fully stable Banach - Å modules. All the results are existing, and they've been listed to complete the requested information.
The main idea of this research is to consider fibrewise pairwise versions of the more important separation axioms of ordinary bitopology named fibrewise pairwise - spaces, fibrewise pairwise - spaces, fibrewise pairwise - spaces, fibrewise pairwise -Hausdorff spaces, fibrewise pairwise functionally -Hausdorff spaces, fibrewise pairwise -regular spaces, fibrewise pairwise completely -regular spaces, fibrewise pairwise -normal spaces and fibrewise pairwise functionally -normal spaces. In addition we offer some results concerning it.
The study aims at analyzing the inconsistent structural and semantic aspects found in the plays of N.A Ostrovsky. The analysis, that includes all the linguistics schools of thoughts in modern Russian language, is performed chronologically to clarify all the ambiguities that the Russian language learners may face. Such difficulties lie in the use of inconsistent aspects with complete declarative sentences and adverbial clauses. Hence, it constructs a new sentence category that consists of secondary clause and its syncretism semantic.
The study illustrates the wide scope of both studying the sentence inconsistent
... Show More
The aim of this research is to study some types of fibrewise fuzzy topological spaces. The six major goals are explored in this thesis. The very first goal, introduce and study the notions types of fibrewise topological spaces, namely fibrewise fuzzy j-topological spaces, Also, we introduce the concepts of fibrewise j-closed fuzzy topological spaces, fibrewise j-open fuzzy topological spaces, fibrewise locally sliceable fuzzy j-topological spaces and fibrewise locally sectionable fuzzy j-topological spaces. Furthermore, we state and prove several Theorems concerning these concepts, where j={δ,θ,α,p,s,b,β} The second goal is to introduce weak and strong forms of fibrewise fuzzy ω-topological spaces, namely the fibrewise fuz
... Show More
(5)
(3)
Arabic text classification is a challenging task because of the complex morphology of the language, the existence of different writing forms and a multitude of dialects, which can result in sparser common text representations. While transformer models such as AraBERT have obtained superior results on many Arabic NLP tasks, their high computational requirements make them difficult to deploy in environments with limited hardware resources. In some cases this can also make the model less practical for researchers working with basic computer systems. This study focuses on a more practical issue: how much accuracy a simple classifier may lose when the amount of required computation is reduced. We use a combined TF-IDF representation based on bo
... Show More