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.
Botnet detection develops a challenging problem in numerous fields such as order, cybersecurity, law, finance, healthcare, and so on. The botnet signifies the group of co-operated Internet connected devices controlled by cyber criminals for starting co-ordinated attacks and applying various malicious events. While the botnet is seamlessly dynamic with developing counter-measures projected by both network and host-based detection techniques, the convention techniques are failed to attain sufficient safety to botnet threats. Thus, machine learning approaches are established for detecting and classifying botnets for cybersecurity. This article presents a novel dragonfly algorithm with multi-class support vector machines enabled botnet
... Show MoreMany academics have concentrated on applying machine learning to retrieve information from databases to enable researchers to perform better. A difficult issue in prediction models is the selection of practical strategies that yield satisfactory forecast accuracy. Traditional software testing techniques have been extended to testing machine learning systems; however, they are insufficient for the latter because of the diversity of problems that machine learning systems create. Hence, the proposed methodologies were used to predict flight prices. A variety of artificial intelligence algorithms are used to attain the required, such as Bayesian modeling techniques such as Stochastic Gradient Descent (SGD), Adaptive boosting (ADA), Decision Tre
... Show MoreMany academics have concentrated on applying machine learning to retrieve information from databases to enable researchers to perform better. A difficult issue in prediction models is the selection of practical strategies that yield satisfactory forecast accuracy. Traditional software testing techniques have been extended to testing machine learning systems; however, they are insufficient for the latter because of the diversity of problems that machine learning systems create. Hence, the proposed methodologies were used to predict flight prices. A variety of artificial intelligence algorithms are used to attain the required, such as Bayesian modeling techniques such as Stochastic Gradient Descent (SGD), Adaptive boosting (ADA), Deci
... Show MoreThe present work aims to study forward osmosis process using different kinds of draw solutions and membranes. Three types of draw solutions (sodium chloride, sodium formate, and sodium acetate) were used in forward osmosis process to evaluate their effectiveness with respect to water flux and reverse salt flux. Experiments conducted in a laboratory-scale forward osmosis (FO) unit in cross flow flat sheet membrane cell. Three types of membranes (Thin film composite (TFC), Cellulose acetate (CA), and Cellulose triacetate (CTA)) were used to determine the water flux under osmotic pressure as a driving force. The effect of temperature, draw solution concentration, feed and draw solution flow rate, and membrane types, were studied with
... Show MoreThe traveling salesman problem (TSP) is a well-known and important combinatorial optimization problem. The goal is to ï¬nd the shortest tour that visits each city in a given list exactly once and then returns to the starting city. In this paper we exploit the TSP to evaluate the minimum total cost (distance or time) for Iraqi cities. So two main methods are investigated to solve this problem; these methods are; Dynamic Programming (DP) and Branch and Bound Technique (BABT). For the BABT, more than one lower and upper bounds are be derived to gain the best one. The results of BABT are completely identical to DP, with less time for number of cities (n), 5 ≤ n ≤ 25. These results proof the efficiency of BABT compared with so
... Show MoreThe Costing Accounting is one the analytic tools which plays important role by support the management in planning& control and decisions-making ,as it became attendant necessity to establish any project whether industrial ,commercial ,service or agriculture ..etc.
The consolidated accounting system has committed the companies to have their active costing system in which the management can obtain their own data, but we found most of the economic units face problems of applying the costing system because of reasons related to the system design itself or might be related to the requirements of the application success.
... Show More