The Assignment model is a mathematical model that aims to express a real problem facing factories and companies which is characterized by the guarantee of its activity in order to make the appropriate decision to get the best allocation of machines or jobs or workers on machines in order to increase efficiency or profits to the highest possible level or reduce costs or time To the extent possible, and in this research has been using the method of labeling to solve the problem of the fuzzy assignment of real data has been approved by the tire factory Diwaniya, where the data included two factors are the factors of efficiency and cost, and was solved manually by a number of iterations until reaching the optimization solution,

he assignment model represents a mathematical model that aims at expressing an important problem facing enterprises and companies in the public and private sectors, which are characterized by ensuring their activities, in order to take the appropriate decision to get the best allocation of tasks for machines or jobs or workers on the machines that he owns in order to increase profits or reduce costs and time As this model is called multi-objective assignment because it takes into account the factors of time and cost together and hence we have two goals for the assignment problem, so it is not possible to solve by the usual methods and has been resorted to the use of multiple programming The objectives were to solve the problem of

By optimizing the efficiency of a modular simulation model of the PV module structure by genetic algorithm, under several weather conditions, as a portion of recognizing the ideal plan of a Near Zero Energy Household (NZEH), an ideal life cycle cost can be performed. The optimum design from combinations of NZEH-variable designs, are construction positioning, window-to-wall proportion, and glazing categories, which will help maximize the energy created by photovoltaic panels. Comprehensive simulation technique and modeling are utilized in the solar module I-V and for P-V output power. Both of them are constructed on the famous five-parameter model.  In addition, the efficiency of the PV panel is established by the genetic algorithm

In this study, the dynamic modeling and step input tracking control of single flexible link is studied. The Lagrange-assumed modes approach is applied to get the dynamic model of a planner single link manipulator. A Step input tracking controller is suggested by utilizing the hybrid controller approach to overcome the problem of vibration of tip position through motion which is a characteristic of the flexible link system. The first controller is a modified version of the proportional-derivative (PD) rigid controller to track the hub position while sliding mode (SM) control is used for vibration damping. Also, a second controller (a fuzzy logic based proportional-integral plus derivative (PI+D) control scheme) is developed for both vibra

Machine learning models have recently provided great promise in diagnosis of several ophthalmic disorders, including keratoconus (KCN). Keratoconus, a noninflammatory ectatic corneal disorder characterized by progressive cornea thinning, is challenging to detect as signs may be subtle. Several machine learning models have been proposed to detect KCN, however most of the models are supervised and thus require large well-annotated data. This paper proposes a new unsupervised model to detect KCN, based on adapted flower pollination algorithm (FPA) and the k-means algorithm. We will evaluate the proposed models using corneal data collected from 5430 eyes at different stages of KCN severity (1520 healthy, 331 KCN1, 1319 KCN2, 1699 KCN3 a

The expanding use of multi-processor supercomputers has made a significant impact on the speed and size of many problems. The adaptation of standard Message Passing Interface protocol (MPI) has enabled programmers to write portable and efficient codes across a wide variety of parallel architectures. Sorting is one of the most common operations performed by a computer. Because sorted data are easier to manipulate than randomly ordered data, many algorithms require sorted data. Sorting is of additional importance to parallel computing because of its close relation to the task of routing data among processes, which is an essential part of many parallel algorithms. In this paper, sequential sorting algorithms, the parallel implementation of man