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.
Abstract
The research aims to identify tax exemptions, their objectives and types, as well as to shed light on the concept of sustainable development, its objectives, dimensions and indicators (economic, social and environmental), as well as to analyze the relationship between tax exemptions and economic development, in addition to measuring and analyzing the impact of tax exemptions on economic development in Iraq for the period ( 2015 - 2021) using the NARDL model. The research problem centers on the fact that failure to employ financial policy tools correctly led to a weakness in achieving economic justice, which leads to a failure to improve social welfar
... Show MoreAbstract
The problem of the study is the main question (Can tourism planning address the phenomenon of unemployment in Iraq ?) , And the importance of the study in the fact that the tourism sector can become an effective development alternative in many countries, especially Iraq, as tourism contributes to diversify sources of income and stimulate other economic sectors , We know how important Iraq's qualifications are in the field of tourism and what it can generate on the public treasury, To confirm the current study on the need to pay attention to tourism planning for its role in providing employment opportunities that reduce the unemployment rate in the future.
&n
... Show MoreBackground: Complete removal of filling material from the root canal is an essential requirement for endodontic retreatment. The purpose of the present study is to evaluate and compare the dissolving capabilities of various solvents (Xylene, Eugenate Desobturator, Eucalyptol, EDTA and Distilled water (as a control)) on four different types of sealer (Endofill, Apexit Plus, AH Plus and EndoSequence bioceramic sealer). Materials and method: Eighty samples of each sealer were prepared according to the manufacturers' instructions and then divided into ten groups (of 8 samples) for immersion in the respective solvents for 2 and 5 min immersion periods. Each sealer specimen was weighed to obtain its initial mass. The specimens were immersed in
... Show MoreIn this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons
... Show Moreconventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation.
Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are
LK Abood, RA Ali, M Maliki, International Journal of Science and Research, 2015 - Cited by 2
Recently, a new secure steganography algorithm has been proposed, namely, the secure Block Permutation Image Steganography (BPIS) algorithm. The new algorithm consists of five main steps, these are: convert the secret message to a binary sequence, divide the binary sequence into blocks, permute each block using a key-based randomly generated permutation, concatenate the permuted blocks forming a permuted binary sequence, and then utilize a plane-based Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image file format. The performance of algorithm was given a preliminary evaluation through estimating the PSNR (Peak Signal-to-Noise Ratio) of the stego image for limited number of experiments comprised hiding
... Show More