In this paper, one of the Machine Scheduling Problems is studied, which is the problem of scheduling a number of products (n-jobs) on one (single) machine with the multi-criteria objective function. These functions are (completion time, the tardiness, the earliness, and the late work) which formulated as . The branch and bound (BAB) method are used as the main method for solving the problem, where four upper bounds and one lower bound are proposed and a number of dominance rules are considered to reduce the number of branches in the search tree. The genetic algorithm (GA) and the particle swarm optimization (PSO) are used to obtain two of the upper bounds. The computational results are calculated by coding (progr

In this paper we will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM).

The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5≤ n ≤500, where n is the number of visited cities.

One-third of the total waste generated in the world is construction and demolition waste. Reducing the life cycle of building materials includes increasing their recycling and reuse by using recycled aggregates. By preventing, the need to open new aggregate quarries and reducing the amount of construction waste dumped into landfills, the use of recycled concrete aggregate in drum compacted concrete protects the environment. Four samples of PRCC were prepared for testing (compressive strength, tensile strength, flexural strength, density, water absorption, porosity) as the reference mix and (10, 15, and 20%) of fine recycled concrete aggregate as a partial replacement for fine natural aggregate by volume. The mix is designed according to

     The searching process using a binary codebook of combined Block Truncation Coding (BTC) method and Vector Quantization (VQ), i.e. a full codebook search for each input image vector to find the best matched code word in the codebook, requires a long time.   Therefore, in this paper, after designing a small binary codebook, we adopted a new method by rotating each binary code word in this codebook into 90⁰ to 270⁰ step 90⁰ directions. Then, we systematized each code word depending on its angle  to involve four types of binary code books (i.e. Pour when , Flat when  , Vertical when, or Zigzag). The proposed scheme was used for decreasing the time of the coding pro

Let R be a commutative ring with identity and let M be a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of semi-essential submodules which introduced by Ali S. Mijbass and Nada K. Abdullah, and we make simple changes to the definition relate with the zero submodule, so we say that a submodule N of an R-module M is called semi-essential, if whenever N ∩ P = (0), then P = (0) for each prime submodule P of M. Various properties of semi-essential submodules are considered.

   There is no doubt that the project control function is very important for administration, so the project Management depends on to monitor and control the project. The project control integrated to the planning which is the base of the administration functions; planning, organizing, directing, and controlling. Without project control cannot be insure to fulfill the plan of the project by the budget and specified time. The project management apply many methods of control to achieve the goals of project which are cost, time, and required specifications. Earned Value Management one of control methods that used in the project by international companies.

Earned Value Method is used in the project o

Throughout this paper R represents commutative ring with identity and M is a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of weak essential submodules which introduced by Muna A. Ahmed, where a submodule N of an R-module M is called weak essential, if N ? P ? (0) for each nonzero semiprime submodule P of M. In this paper we rewrite this definition in another formula. Some new definitions are introduced and various properties of weak essential submodules are considered.

The concept of the Extend Nearly Pseudo Quasi-2-Absorbing submodules was recently introduced by Omar A. Abdullah and Haibat K. Mohammadali in 2022, where he studies this concept and it is relationship to previous generalizationsm especially  2-Absorbing submodule and Quasi-2-Absorbing submodule, in addition to studying the most important Propositions, charactarizations and Examples. Now in this research, which is considered a continuation of the definition that was presented earlier, which is the Extend Nearly Pseudo Quasi-2-Absorbing submodules, we have completed the study of this concept in multiplication modules. And the relationship between the Extend Nearly Pseudo Quasi-2-Absorbing submodule and Extend Nearly Pseudo Quasi-2-Abs

     Coronavirus disease (COVID-19), which is caused by SARS-CoV-2, has been announced as a global pandemic by the World Health Organization (WHO), which results in the collapsing of the healthcare systems in several countries around the globe. Machine learning (ML) methods are one of the most utilized approaches in artificial intelligence (AI) to classify COVID-19 images. However, there are many machine-learning methods used to classify COVID-19. The question is: which machine learning method is best over multi-criteria evaluation? Therefore, this research presents benchmarking of COVID-19 machine learning methods, which is recognized as a multi-criteria decision-making (MCDM) problem. In the recent century, the trend of developing

Throughout this paper R represents commutative ring with identity and M is a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of weak essential submodules which introduced by Muna A. Ahmed, where a submodule N of an R-module M is called weak essential, if N ? P ? (0) for each nonzero semiprime submodule P of M. In this paper we rewrite this definition in another formula. Some new definitions are introduced and various properties of weak essential submodules are considered.