This paper presents an alternative method for cloud task scheduling problem which aims to
minimize makespan that required to schedule a number of tasks on different Virtual …

Metaheuristics have been showing interesting results in solving hard optimization problems.
However, they become limited in terms of effectiveness and runtime for high dimensional …

Evolutionary algorithms (EAs) have been attracting research attention for last decades. They
were shown to be very efficient in solving various complex optimization problems in most …

The fingerprint is one kind of biometric. This biometric unique data have to be processed
well and secure. The problem gets more complicated as data grows. This work is conducted …

Abstract The Group-based Parallel Multi-scheduler (GPMS), introduced in this paper, is
aimed at effectively exploiting the benefits of multicore systems for Grid scheduling by …

Scheduling drilling activities for oil and gas exploration involves solving a problem of optimal
routing of a fleet of vehicles that represent drilling rigs. Given a set of sites in some …

In recent years there has been much interest in the MCTS algorithm, a new, adaptive,
randomized optimization algorithm. In fields as diverse as Artificial Intelligence, Operations …

Implementation of memetic algorithms on GPU was proven as an efficient way to speed up
the time required to find a solution for diverse problems. In recent years, thanks to the …

This article presents a method of enhancing the efficiency of Grid scheduling algorithms by
employing a job grouping method based on priorities and also grouping of Grid machines …

The paper presents using of enumerative combinatorics for open job shop scheduling
problems. Two approaches are described–one approach aims to determine a schedule that …