In this paper, we studied the scheduling of jobs on a single machine. Each of n jobs is to be processed without interruption and becomes available for processing at time zero. The objective is to find a processing order of the jobs, minimizing the sum of maximum earliness and maximum tardiness. This problem is to minimize the earliness and tardiness values, so this model is equivalent to the just-in-time production system. Our lower bound depended on the decomposition of the problem into two subprograms. We presented a novel heuristic approach to find a near-optimal solution for the problem. This approach depends on finding efficient solutions for two problems. The first problem is minimizing total completion time and maximum tardiness. The second is minimizing total completion time and maximum earliness. We used these efficient solutions to find a near-optimal solution for another problem which is a sum of maximum earliness and maximum tardiness. This means we eliminate the total completion time from the two problems. The algorithm was tested on a set of problems of different n. Computational results demonstrate the efficiency of the proposed method.
The presented work includes the Homotopy Transforms of Analysis Method (HTAM). By this method, the approximate solution of nonlinear Navier- Stokes equations of fractional order derivative was obtained. The Caputo's derivative was used in the proposed method. The desired solution was calculated by using the convergent power series to the components. The obtained results are demonstrated by comparison with the results of Adomain decomposition method, Homotopy Analysis method and exact solution, as explained in examples (4.1) and (4.2). The comparison shows that the used method is powerful and efficient.
Finding a path solution in a dynamic environment represents a challenge for the robotics researchers, furthermore, it is the main issue for autonomous robots and manipulators since nowadays the world is looking forward to this challenge. The collision free path for robot in an environment with moving obstacles such as different objects, humans, animals or other robots is considered as an actual problem that needs to be solved. In addition, the local minima and sharp edges are the most common problems in all path planning algorithms. The main objective of this work is to overcome these problems by demonstrating the robot path planning and obstacle avoidance using D star (D*) algorithm based on Particle Swarm Optimization (PSO)
... Show MoreAutomatic Programming Assessment (APA) has been gaining lots of attention among researchers mainly to support automated grading and marking of students’ programming assignments or exercises systematically. APA is commonly identified as a method that can enhance accuracy, efficiency and consistency as well as providing instant feedback on students’ programming solutions. In achieving APA, test data generation process is very important so as to perform a dynamic testing on students’ assignment. In software testing field, many researches that focus on test data generation have demonstrated the successful of adoption of Meta-Heuristic Search Techniques (MHST) so as to enhance the procedure of deriving adequate test data for efficient t
... Show MoreIntelligent systems can be used to build systems that simulate human behavior. One such system is lip reading. Hence, lip reading is considered one of the hardest problems in image analysis, and thus machine learning is used to solve this problem, which achieves remarkable results, especially when using a deep neural network, in which it dives deeply into the texture of any input. Microlearning is the new trend in E-learning. It is based on small pieces of information to make the learning process easier and more productive. In this paper, a proposed system for multi-layer lip reading is presented. The proposed system is based on micro content (letters) to achieve the lip reading process using deep learning and auto-correction mo
... Show MoreWe extended the characterization of strict local minimizers of order two in ward,s
theorem for nonlinear problem to a certain class of nonsmooth semi-infinite problems with inequality constraints in the nonparametric constraint case.
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
... Show MoreThe theory of Multi-Criteria Decision Making (MCDM) was introduced in the second half of the twentieth century and aids the decision maker to resolve problems when interacting criteria are involved and need to be evaluated. In this paper, we apply MCDM on the problem of the best drug for rheumatoid arthritis disease. Then, we solve the MCDM problem via -Sugeno measure and the Choquet integral to provide realistic values in the process of selecting the most appropriate drug. The approach confirms the proper interpretation of multi-criteria decision making in the drug ranking for rheumatoid arthritis.
The article reflects the results of the analysis of the use of metaphors as one of the main means used by Lyudmila Ulitskaya when writing the novel “Sincerely Yours Shurik” to form the image of the main hero in the novel. The main purpose of the article is to consider metaphors, which helped the author to form the image of the main character Shurik in the text space through the stages of his life path, closely related to the people around him, who is always happy to be useful (hence the title "Sincerely Yours"), among which the female images of his relatives, girlfriends and others stand out as a special layer in the narrative. And in the course of the study, the following tasks were solved: the metaphors that make up the image of the
... Show MoreIn this paper , an efficient new procedure is proposed to modify third –order iterative method obtained by Rostom and Fuad [Saeed. R. K. and Khthr. F.W. New third –order iterative method for solving nonlinear equations. J. Appl. Sci .7(2011): 916-921] , using three steps based on Newton equation , finite difference method and linear interpolation. Analysis of convergence is given to show the efficiency and the performance of the new method for solving nonlinear equations. The efficiency of the new method is demonstrated by numerical examples.
One of the significant stages in computer vision is image segmentation which is fundamental for different applications, for example, robot control and military target recognition, as well as image analysis of remote sensing applications. Studies have dealt with the process of improving the classification of all types of data, whether text or audio or images, one of the latest studies in which researchers have worked to build a simple, effective, and high-accuracy model capable of classifying emotions from speech data, while several studies dealt with improving textual grouping. In this study, we seek to improve the classification of image division using a novel approach depending on two methods used to segment the images. The first
... Show More