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)
In this modern Internet era and the transition to IPv6, routing protocols must adjust to assist this transformation. RIPng, EIGRPv6 and OSPFv3 are the dominant IPv6 IGRP (Interior Gateway Routing Protocols). Selecting the best routing protocol among the available is a critical task, which depends upon the network requirement and performance parameters of different real time applications. The primary motivation of this paper is to estimate the performance of these protocols in real time applications. The evaluation is based on a number of criteria including: network convergence duration, Http Page Response Time, DB Query Response Time, IPv6 traffic dropped, video packet delay variation and video packet end to end de
... Show MoreThe tracking of satellites motion and their path around the earth is important things in the mechanical of satellites motion. Significant parameters for the determination of time entrance and existence of the satellite could be obtained from the shadow of the earth. In the present work the tracking and time determination for entry and exit from earth shadow have been studied. In the present work we built a software for tracking the motion of satellites in orbit around the earth and determine the change of both distance and speed as a function of time. The perturbations effect on the satellite has been neglected from the earth atmosphere drag and the earth gravity and other effects. The equation for calculating the shadow is solved using num
... Show MoreAccurate prediction and optimization of morphological traits in Roselle are essential for enhancing crop productivity and adaptability to diverse environments. In the present study, a machine learning framework was developed using Random Forest and Multi-layer Perceptron algorithms to model and predict key morphological traits, branch number, growth period, boll number, and seed number per plant, based on genotype and planting date. The dataset was generated from a field experiment involving ten Roselle genotypes and five planting dates. Both RF and MLP exhibited robust predictive capabilities; however, RF (R² = 0.84) demonstrated superior performance compared to MLP (R² = 0.80), underscoring its efficacy in capturing the nonlinear genoty
... Show MoreThere are many researches deals with constructing an efficient solutions for real problem having Multi - objective confronted with each others. In this paper we construct a decision for Multi – objectives based on building a mathematical model formulating a unique objective function by combining the confronted objectives functions. Also we are presented some theories concerning this problem. Areal application problem has been presented to show the efficiency of the performance of our model and the method. Finally we obtained some results by randomly generating some problems.
The aim of this paper is to propose an efficient three steps iterative method for finding the zeros of the nonlinear equation f(x)=0 . Starting with a suitably chosen , the method generates a sequence of iterates converging to the root. The convergence analysis is proved to establish its five order of convergence. Several examples are given to illustrate the efficiency of the proposed new method and its comparison with other methods.
For modeling a photovoltaic module, it is necessary to calculate the basic parameters which control the current-voltage characteristic curves, that is not provided by the manufacturer. Generally, for mono crystalline silicon module, the shunt resistance is generally high, and it is neglected in this model. In this study, three methods are presented for four parameters model. Explicit simplified method based on an analytical solution, slope method based on manufacturer data, and iterative method based on a numerical resolution. The results obtained for these methods were compared with experimental measured data. The iterative method was more accurate than the other two methods but more complexity. The average deviation of
... Show MoreThis manuscript presents several applications for solving special kinds of ordinary and partial differential equations using iteration methods such as Adomian decomposition method (ADM), Variation iterative method (VIM) and Taylor series method. These methods can be applied as well as to solve nonperturbed problems and 3rd order parabolic PDEs with variable coefficient. Moreover, we compare the results using ADM, VIM and Taylor series method. These methods are a commination of the two initial conditions.
A Tonido cloud server provides a private cloud storage solution and synchronizes customers and employees with the required cloud services over the enterprise. Generally, access to any cloud services by users is via the Internet connection, which can face some problems, and then users may encounter in accessing these services due to a weak Internet connection or heavy load sometimes especially with live video streaming applications overcloud. In this work, flexible and inexpensive proposed accessing methods are submitted and implemented concerning real-time applications that enable users to access cloud services locally and regionally. Practically, to simulate our network connection, we proposed to use the Raspberry-pi3 m
... Show More