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)
Modern automation robotics have replaced many human workers in industrial factories around the globe. The robotic arms are used for several manufacturing applications, and their responses required optimal control. In this paper, a robust approach of optimal position control for a DC motor in the robotic arm system is proposed. The general component of the automation system is first introduced. The mathematical model and the corresponding transfer functions of a DC motor in the robotic arm system are presented. The investigations of using DC motor in the robotic arm system without controller lead to poor system performance. Therefore, the analysis and design of a Proportional plus Integration plus Divertive (PID) controller is illustrated.
... Show MoreDrug consultation is an important part of pharmaceutical care. mobile phone call or text message can serve as an easy, effective, and implementable alternative to improving medication adherence and clinical outcomes by providing the information needed significantly for people with chronic illnesses like diabetes and hypertension particularly during pandemics like COVID-19 pandemic.
The kinetics of removing cadmium from aqueous solutions was studied using a bio-electrochemical reactor with a packed bed rotating cylindrical cathode. The effect of applied voltage, initial concentration of cadmium, cathode rotation speed, and pH on the reaction rate constant (k) was studied. The results showed that the cathodic deposition occurred under the control of mass transfer for all applied voltage values used in this research. Accordingly, the relationship between logarithmic concentration gradient with time can be represented by a first-order kinetic rate equation. It was found that the rate constant (k) depends on the applied voltage, the initial cadmium concentration, the pH and the rotational speed of cathode. It
... Show More