In this paper, we present a Branch and Bound (B&B) algorithm of scheduling (n) jobs on a single machine to minimize the sum total completion time, total tardiness, total earliness, number of tardy jobs and total late work with unequal release dates. We proposed six heuristic methods for account upper bound. Also to obtain lower bound (LB) to this problem we modified a (LB) select from literature, with (Moore algorithm and Lawler's algorithm). And some dominance rules were suggested. Also, two special cases were derived. Computational experience showed the proposed (B&B) algorithm was effective in solving problems with up to (16) jobs, also the upper bounds and the lower bound were effective in restricting the search.
The research deals with the structures of the contemporary travelers' buildings in particular, and which is a functional complex installations where flexibility, technical and stereotypes play an important role as well as the human values These facilities must represent physiological and psychological comfort for travelers. TThose are facilities where architectural form plays a distinguished role in reversing the specialty and identity of the building. Hence the importance of the subject has been in forced, as a result for the need to study these facilities and to determine the impact and affects by the surrounding environment, to the extent of the urban, environmental, urban, social, and psychological levels. The importance of the resea
... Show MoreThe majority of real-world problems involve not only finding the optimal solution, but also this solution must satisfy one or more constraints. Differential evolution (DE) algorithm with constraints handling has been proposed to solve one of the most fundamental problems in cellular network design. This proposed method has been applied to solve the radio network planning (RNP) in the forthcoming 5G Long Term Evolution (5G LTE) wireless cellular network, that satisfies both deployment cost and energy savings by reducing the number of deployed micro base stations (BSs) in an area of interest. Practically, this has been implemented using constrained strategy that must guarantee good coverage for the users as well. Three differential evolution
... Show MoreResearch Summary
First: the problem of research and its importance
The teacher's success in facilitating the students' learning and growth according to the educational and educational goals set out, he must identify the problems of discipline of students in the classroom in terms of sources and reasons and types and methods of prevention and treatment and the teacher to remember that success in his teaching and instruction is not completed more fully once he has the information And knowledge of the subject of the lesson, but must understand the dynamics of the group (class group) and master the skills of classroom management, su
... Show MoreThe reason for conducting this study is to prolong release of miconazole in the ocular site of action by ocular-based gels (OBGs) formulations. The formulation factors affecting on the release from OBG should be studied using various gelling agents in various concentrations to achieve the improvement in retention and residence time in response to prolonged release. In this study, the formulations were prepared using carbopol 940, pectin, sodium alginate, poloxamer 407, and poly(methacrylic acid) at 0.5%, 1%, and 1.5% w/v, respectively. Hydroxypropyl methylcellulose E5 (HPMC E5) 1% was added as thickening agent/viscosity builder. The formulation containing carbopol 940, pectin and sodium alginate at 1.5% w/v, displayed a noticable im
... Show MoreMachine scheduling problems (MSP) are considered as one of the most important classes of combinatorial optimization problems. In this paper, the problem of job scheduling on a single machine is studied to minimize the multiobjective and multiobjective objective function. This objective function is: total completion time, total lead time and maximum tardiness time, respectively, which are formulated as are formulated. In this study, a mathematical model is created to solve the research problem. This problem can be divided into several sub-problems and simple algorithms have been found to find the solutions to these sub-problems and compare them with efficient solutions. For this problem, some rules that provide efficient solutio
... Show MoreThe purpose of this research was to prepare, characterize, and evaluate the new antimicrobial peptide KSL peptide encapsulated in poly(D,L-lactide-co-glycolide) (PLGA)composite microspheres. KSL was loaded in poly(acryloyl hydroxyethyl) starch (acHES) micropar-ticles, and then the peptide-containing microparticles were encapsulated in the PLGA matrix by a solvent extraction /evaporation method.
KSL-loaded PLGA microspheres were also prepared without the starch hydrogel microparticle microspheres for comparison study. KSL peptide microspheres were characterized for drug content, surface morphology, microspheres size determination, polymers stability , in vitro microspheres degradation and in vitro release. KSL peptide
... Show More This study includes Estimating scale parameter, location parameter and reliability function for Extreme Value (EXV) distribution by two methods, namely: -
- Maximum Likelihood Method (MLE).
- Probability Weighted Moments Method (PWM).
Used simulations to generate the required samples to estimate the parameters and reliability function of different sizes(n=10,25,50,100) , and give real values for the parameters are and , replicate the simulation experiments (RP=1000)
... Show MoreSupport vector machine (SVM) is a popular supervised learning algorithm based on margin maximization. It has a high training cost and does not scale well to a large number of data points. We propose a multiresolution algorithm MRH-SVM that trains SVM on a hierarchical data aggregation structure, which also serves as a common data input to other learning algorithms. The proposed algorithm learns SVM models using high-level data aggregates and only visits data aggregates at more detailed levels where support vectors reside. In addition to performance improvements, the algorithm has advantages such as the ability to handle data streams and datasets with imbalanced classes. Experimental results show significant performance improvements in compa
... Show More