Within this research, The problem of scheduling jobs on a single machine is the subject of study to minimize the multi-criteria and multi-objective functions. The first problem, minimizing the multi-criteria, which include Total Completion Time, Total Late Work, and Maximum Earliness Time (∑𝐶𝑗, ∑𝑉𝑗, 𝐸𝑚𝑎𝑥), and the second problem, minimizing the multi-objective functions ∑𝐶𝑗 + ∑𝑉𝑗 +𝐸𝑚𝑎𝑥 are the problems at hand in this paper. In this study, a mathematical model is created to address the research problems, and some rules provide efficient (optimal) solutions to these problems. It has also been proven that each optimal solution for ∑𝐶𝑗 + ∑𝑉𝑗 + 𝐸𝑚𝑎𝑥 is an effic

This paper proposes a completion that can allow fracturing four zones in a single trip in the well called “Y” (for confidential reasons) of the field named “X” (for confidential reasons). The steps to design a well completion for multiple fracturing are first to select the best completion method then the required equipment and the materials that it is made of. After that, the completion schematic must be drawn by using Power Draw in this case, and the summary installation procedures explained. The data used to design the completion are the well trajectory, the reservoir data (including temperature, pressure and fluid properties), the production and injection strategy. The results suggest that multi-stage hydraulic fracturing can

In this work, polyvinylpyrrolidone (PVP), Multi-walled carbon nanotubes (MWCNTs) nanocomposite was prepared and hybrid with Graphene (Gr) by casting method. The morphological and optical properties were investigated. Fourier Transformer-Infrared (FT-IR) indicates the presence of primary distinctive peaks belonging to vibration groups that describe the prepared samples. Scanning Electron Microscopy (SEM) images showed a uniform dispersion of graphene within the PVP-MWCNT nanocomposite. The results of the optical study show decrease in the energy gap with increasing MWCNT and graphene concentration. The absorption coefficient spectra indicate the presence of two absorption peaks at 282 and 287 nm attributed to the π-π* electronic tr

Nowadays, people's expression on the Internet is no longer limited to text, especially with the rise of the short video boom, leading to the emergence of a large number of modal data such as text, pictures, audio, and video. Compared to single mode data ,the multi-modal data always contains massive information. The mining process of multi-modal information can help computers to better understand human emotional characteristics. However, because the multi-modal data show obvious dynamic time series features, it is necessary to solve the dynamic correlation problem within a single mode and between different modes in the same application scene during the fusion process. To solve this problem, in this paper, a feature extraction framework of

This paper is attempt to study the nonlinear second order delay multi-value problems. We want to say that the properties of such kind of problems are the same as the properties of those with out delay just more technically involved. Our results discuss several known properties, introduce some notations and definitions. We also give an approximate solution to the coined problems using the Galerkin's method.

The current research seeks to identify mono-multi Vision and its relation to the psychological rebellion and personality traits of university students. To achieve this aim, the researcher has followed all the procedures of the descriptive correlational approach, as it is the closest approach to the objectives of the current research. The researcher has determined his research community for Baghdad University students for the academic year 2019-2020. As for the research sample, it was chosen by the random stratified method with a sample of (500) male and female students. In order to collect data from the research sample, the researcher adopted a mono-multi-dimensional scale

(Othman, 2007), the researcher designed a psychological r

Malware represents one of the dangerous threats to computer security. Dynamic analysis has difficulties in detecting unknown malware. This paper developed an integrated multi – layer detection approach to provide more accuracy in detecting malware. User interface integrated with Virus Total was designed as a first layer which represented a warning system for malware infection, Malware data base within malware samples as a second layer, Cuckoo as a third layer, Bull guard as a fourth layer and IDA pro as a fifth layer. The results showed that the use of fifth layers was better than the use of a single detector without merging. For example, the efficiency of the proposed approach is 100% compared with 18% and 63% of Virus Total and Bel

Aggregate production planning (APP) is one of the most significant and complicated problems in production planning and aim to set overall production levels for each product category to meet fluctuating or uncertain demand in future. and to set decision concerning hiring, firing, overtime, subcontract, carrying inventory level. In this paper, we present a simulated annealing (SA) for multi-objective linear programming to solve APP. SA is considered to be a good tool for imprecise optimization problems. The proposed model minimizes total production and workforce costs. In this study, the proposed SA is compared with particle swarm optimization (PSO). The results show that the proposed SA is effective in reducing total production costs and req

In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise closure topological spaces, fibrewise wake topological spaces, fibrewise strong topological spaces over B. Also, we introduce the concepts of fibrewise w-closed (resp., w-coclosed, w-biclosed) and w-open (resp., w-coopen, w-biopen) topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.

   The main focus of this research is to examine the Travelling Salesman Problem (TSP) and the methods used to solve this problem where this problem is considered as one of the combinatorial optimization problems which met wide publicity and attention from the researches for to it's simple formulation and important applications and engagement to the rest of combinatorial problems , which is based on finding the optimal path through known number of cities where the salesman visits each city only once before returning to the city of departure n this research , the benefits  of( FMOLP)   algorithm is employed as one of the best methods to solve the (TSP) problem and the application of the algorithm in conjun