Flexible job-shop scheduling problem (FJSP) is one of the instances in flexible manufacturing systems. It is considered as a very complex to control. Hence generating a control system for this problem domain is difficult. FJSP inherits the job-shop scheduling problem characteristics. It has an additional decision level to the sequencing one which allows the operations to be processed on any machine among a set of available machines at a facility. In this article, we present Artificial Fish Swarm Algorithm with Harmony Search for solving the flexible job shop scheduling problem. It is based on the new harmony improvised from results obtained by artificial fish swarm algorithm. This improvised solution is sent to comparison to an overall best solution. When it is the better one, it replaces with the artificial fish swarm solution from which this solution was improvised. Meanwhile the best improvised solutions are carried over to the Harmony Memory. The objective is to minimize a total completion time (makespan) and to make the proposed approach as a portion of the expert and the intelligent scheduling system for remanufacturing decision support. Harmony search algorithm has demonstrated to be efficient, simple and strong optimization algorithm. The ability of exploration in any optimization algorithm is one of the key points. The obtained optimization results show that the proposed algorithm provides better exploitation ability and enjoys fast convergence to the optimum solution. As well, comparisons with the original artificial fish swarm algorithm demonstrate improved efficiency.
Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh
... Show MoreIn many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally th
... Show MoreKrawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the
... Show MoreThis paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t
... Show MoreIn this paper, three approximate methods namely the Bernoulli, the Bernstein, and the shifted Legendre polynomials operational matrices are presented to solve two important nonlinear ordinary differential equations that appeared in engineering and applied science. The Riccati and the Darcy-Brinkman-Forchheimer moment equations are solved and the approximate solutions are obtained. The methods are summarized by converting the nonlinear differential equations into a nonlinear system of algebraic equations that is solved using Mathematica®12. The efficiency of these methods was investigated by calculating the root mean square error (RMS) and the maximum error remainder (𝑀𝐸𝑅n) and it was found that the accuracy increases with increasi
... Show MoreThis research includes a study of the ability of Iraqi porcelanite rocks powder to remove the basic Safranine dye from its aqueous process by adsorption. The experiments were carried out at 298Kelvin in order to determine the effect of the starting concentration for Safranin dye, mixing time, pH, and the effect of ionic Strength. The good conditions were perfect for safranine dye adsorption was performed when0.0200g from that adsorbed particles and the removal max percentage was found be 96.86% at 9 mg/L , 20 minutes adsorption time and at PH=8 and in 298 K. The isothermal equilibrum stoichiometric adsorption confirmed, the process data were examined by Langmuir, Freundlich and Temkin adsorption equations at different temperatures
... Show MoreThis histological study was carried out to compare between the thyroid gland of mice (as a model of the mammals) and the thyroid tissue of fish. Unlike mice, the thyroid gland of fish can't be recognized by naked eye. The present study revealed that the thyroid of mice varied from that of fish by the location and the histological structure. The study classified the physiological state of the thyroid of mice into three states and that of the fish into only two states. Accordingly, the study concluded that the metabolism of thyroid fish was of moderate type.