The presented study investigated the scheduling regarding jobs on a single machine. Each job will be processed with no interruptions and becomes available for the processing at time 0. The aim is finding a processing order with regard to jobs, minimizing total completion time , total late work , and maximal tardiness which is an NP-hard problem. In the theoretical part of the present work, the mathematical formula for the examined problem will be presented, and a sub-problem of the original problem of minimizing the multi-objective functions is introduced. Also, then the importance regarding the dominance rule (DR) that could be applied to the problem to improve good solutions will be shown. While in the practical part, two exact methods are important; a Branch and Bound algorithm (BAB) and a complete enumeration (CEM) method are applied to solve the three proposed MSP criteria by finding a set of efficient solutions. The experimental results showed that CEM can solve problems for up to jobs. Two approaches of the BAB method were applied: the first approach was BAB without dominance rule (DR), and the BAB method used dominance rules to reduce the number of sequences that need to be considered. Also, this method can solve problems for up to , and the second approach BAB with dominance rule (DR), can solve problems for up to jobs in a reasonable time to find efficient solutions to this problem. In addition, to find good approximate solutions, two heuristic methods for solving the problem are proposed, the first heuristic method can solve up to jobs, while the second heuristic method can solve up to jobs. Practical experiments prove the good performance regarding the two suggested approaches for the original problem. While for a sub-problem the experimental results showed that CEM can solve problems for up to jobs, the BAB without dominance rule (DR) can solve problems for up to , and the second approach BAB with dominance rule (DR), can solve problems for up to jobs in a reasonable time to find efficient solutions to this problem. Finally, the heuristic method can solve up to jobs. Arithmetic results are calculated by coding (programming) algorithms using (MATLAB 2019a)
The study aimed to reach the best rating for the views and variables in the totals characterized by qualities and characteristics common within each group and distinguish them from aggregates other for the purpose of distinguishing between Iraqi provinces which suffer from deprivation, for the purpose of identifying the status of those provinces in the early allowing interested parties and regulators to intervene to take appropriate corrective action in a timely manner. Style has been used cluster analysis Cluster analysis to reach the best rating to those totals from the provinces that suffer from problems, where the provinces were classified, based on the variables (Edu
... Show More
In this paper, the ability of using corn leaves as low-cost natural biowaste adsorbent material for the removal of Indigo Carmen (IC) dye was studied. Batch mode system was used to study several parameters such as, contact time (4 days), concentration of dye (10-50) ppm, adsorbent dosage (0.05-0.25) gram, pH (2-12) and temperature (30-60) oC. The corn leaf was characterized by Fourier-transform infrared spectroscopy device before and after the adsorption process of the IC dye and scanning electron microscope device was used to find the morphology of the adsorbent material. The experimental data was imputing with several isotherms where it fits with Freundlich (R2 = 0.9
... Show MoreThis paper presents the ability to use cheap adsorbent (corn leaf) for the removal of Malachite Green (MG) dye from its aqueous solution. A batch mode was used to study several factors, dye concentration (50-150) ppm, adsorbent dosage (0.5-2.5) g/L, contact time (1-4) day, pH (2-10), and temperature (30-60) The results indicated that the removal efficiency increases with the increase of adsorbent dosage and contact time, while inversely proportional to the increase in pH and temperature. An SEM device characterized the adsorbent corn leaves. The adsorption's resulting data were in agreement with Freundlich isotherm according to the regression analysis, and the kinetics data followed pseudo-first-or
... Show MoreThe gas chromatography (GC) method in analytical chemistry is a quick and accurate method to detect volatile components like ethanol. A method for determining volatile components known as Headspace chromatography (HS-GC) was developed along with an internal standard method (ISM) to identify ethanol in fermented broth in the laboratory. The aim of this research is determining the concentration of ethanol in fermented broth using capillary column (ZB-1). This method can analyze ethanol concentrations in the fermented medium broth ranging from 10 to 200 g/L. The validation of this method was done in order to obtain the results to be of high precision and the significant, precision was represented as the relative standard deviation (RSD) which
... Show MoreA simple and novel membraneless paper-based microfluidic fuel cell was presented in this study. The occurrence of laminar flow was employed to ensure no mixing of the fuel and oxidant fluids along the bath of reaction. The acidic wastewater was used as a fuel. It was an air-breathing cell, so air and tab water were used as oxidants. Both the fuel and tab water flowed continuously under gravity. Whatman filter paper was used for preparation of the fuel cell channel and two carbon fibre electrodes were used and firmed on the edges of the cell. The performance of the cell was examined over three consecutive days. The results indicated that the present cell has the potential to generate electric power, but an extensive study is required to harv
... Show MoreIn this paper, the construction of Hermite wavelets functions and their operational matrix of integration is presented. The Hermite wavelets method is applied to solve nth order Volterra integro diferential equations (VIDE) by expanding the unknown functions, as series in terms of Hermite wavelets with unknown coefficients. Finally, two examples are given