Task scheduling is heart of any grid application which guides resource allocation in grid. Heuristic task scheduling strategies have been used for optimal task scheduling. Heuristic techniques have been widely used by the researchers to solve resource allocation problem in grid computing. In this paper, we classify heuristic task scheduling strategies in grid on the basis of their characteristi...

This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA a...

Crossover operator plays a crucial role in the efficiency of genetic algorithm (GA). Several crossover operators have been proposed for solving the travelling salesman problem (TSP) in the literature. These operators have paid less attention to the characteristics of the traveling salesman problem, and majority of these operators can only generate feasible solutions. In this paper, a crossover ...

This article presents a comprehensive review of chaos embedded meta-heuristic optimization algorithms and describes the evolution of this algorithms along with some improvements, their combination with various methods as well as their applications. The reported results indicate that chaos embedded algorithms may handle engineering design problems efficiently in terms of precision and convergenc...

Sequential parameter optimization is a heuristic that combines classical and modern statistical techniques to improve the performance of search algorithms. It includes methods for tuning based on classical regression and analysis of variance techniques; tree-based models such as CART and random forest; Gaussian process models (Kriging), and combinations of different meta-modeling approaches. Th...

In this paper, the performance of meta-heuristic algorithms is compared using statistical analysis based on new criteria (powerfulness and effectiveness). Due to large number methods reported so far, choosing one them by researchers has always been challenging. fact, user does not know which these are able solve his complex problem. in order compare several from different categories proposed. c...

A new Meta heuristic approach called ”Randomized gravitational emulation search algorithm (RGES)” for solving vertex covering problems has been designed. This algorithm is found upon introducing randomization concept along with the two of the four primary parameters ’velocity’ and ’gravity’ in physics. A new heuristic operator is introduced in the domain of RGES to maintain feasibility specific...