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 reasons for the totality are varied and multiple, some of which are attributed to the methods of the Arabic language as the participant
Verbal and omnipotent differences in the oud of conscience, which are comprehensive reasons for language in all
And some of these reasons are due to the sciences of the Qur'an, such as cessation and initiation
The explanation of the explanation for the multiplicity of words and differences in them, which necessarily led to a dispute jurisprudence
Linked to the origin of disagreement in the interpretation of the totality and its orientation and understanding and to summarize this subject and diverge
Parts and vocabulary did not receive the necessary care and did not absorb the lesson an
Throughout this paper, a generic iteration algorithm for a finite family of total asymptotically quasi-nonexpansive maps in uniformly convex Banach space is suggested. As well as weak / strong convergence theorems of this algorithm to a common fixed point are established. Finally, illustrative numerical example by using Matlab is presented.
Background: The change in the concepts of cavity preparation and the development of reliable adhesive materials lead to the development of alternative methods of caries removal. Chemo-mechanical caries removal (CMCR) involves the chemical softening of carious dentin, followed by its removal with manual excavation. The present study was conducted to evaluate clinically the efficiency of caries removal using a new chemo-mechanical agent (Papacarie) compared to the conventional drilling method in reduction of total bacterial count. Material and methods: The study is a split mouth design. The sample composes from sixty mandibular deciduous molars teeth in thirty children, between six to nine years of age with bilateral class I deep occlusal car
... Show MoreTotal quality management considers one of the modern scientific entrances which practiced by productivity service organizations alike to provide appropriate quality required outputs according to the needs and desires of customers manage , enable the organization seeking to continue and grow in light of the increasing competition from the satisfy and provide the appropriate total quality management requirements whenever led to face risks that they may have in a manner in which they can be addressed and find ways to avoid them in the future when repeated. &n
... Show MoreABSTRACT
This research aim to measure the critical success factors for total quality management applications, in order to know the key and important role played by these factors at applying the total quality management through a comparative study conducted in a number of a private colleges.
The research problem posed a set of questions, the most important ones are: Are the colleges (sample of research) aware of the critical success factors at applying the total quality management? What is the availability of the critical success factors at the work of the colleges (sample of research)?
What are the critical success factors in the work of the researc
... Show MoreThis study aimed new indications that may clarify the relationships between the total and standard lengths, and the length of the otolith, as well as the thickness and weight of these bones compared to the body weights of two different species of invasive fish in the Iraqi aquatic environment, the common carp
In this work, the fractional damped Burger's equation (FDBE) formula = 0,
In this work, the fractional damped Burger's equation (FDBE) formula = 0,
In this Paper, we proposed two new predictor corrector methods for solving Kepler's equation in hyperbolic case using quadrature formula which plays an important and significant rule in the evaluation of the integrals. The two procedures are developed that, in two or three iterations, solve the hyperbolic orbit equation in a very efficient manner, and to an accuracy that proves to be always better than 10-15. The solution is examined with and with grid size , using the first guesses hyperbolic eccentric anomaly is and , where is the eccentricity and is the hyperbolic mean anomaly.
The basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition for a membership function to find near interior, near boundary and near exterior vertices. Moreover, proved results, examples and counter examples are provided. The Gm-closure structure which suggested in this paper opens up the way for applying rich amount of topological facts and methods in the process of granular computing.