Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...

Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...

Genetic Algorithms (GAs) are powerful search techniques that are used to solve difficult problems in many disciplines. Unfortunately, they can be very demanding in terms of computation load and memory. Parallel Genetic Algorithms (PGAs) are parallel implementations of GAs which can provide considerable gains in terms of performance and scalability. PGAs can easily be implemented on networks of ...

In this paper we introduce an efficient implementation of asynchronously parallel genetic algorithm with adaptive genetic operators. The classic genetic algorithm paradigm is extended with parallelization on one hand and an adaptive operators method on the other. The parallelization of the algorithm is achieved through multithreading mechanism, a very effective and easy to implement technique. ...

We propose a parallel genetic algorithm architecture which parameters are adapted automatically during the search process. The parameters of the search algorithm as selection pressure, mutation rate and mutation step size (or even others) are not fixed during the search process, but they are adapted in time. For their determination a simple, but effective method is used. The algorithm is able t...