International audienceThe flexible flow shop scheduling problem is an NP-hard problem and it requires significant resolution time to find optimal or even adequate solutions when dealing with large size instances. Thus, this paper proposes a dual island genetic algorithm consisting of a parallel cellular model and a parallel pseudo model. This is a two-level parallelization highly consistent with the underlying architecture and is well suited for parallelizing inside or between GPUs and a multi-core CPU. At the higher level, the efficiency of island GAs is improved by exploring new regions within the search space utilizing different methods. In the meantime, the cellular model keeps the population diversity by decentralization and the pseudo...
We propose a Genetic Algorithm for scheduling multiprocessor tasks in multi-stage flow-shop environm...
Task scheduling algorithms are designed mostly with the sole goal of minimizing makespan (completion...
In this paper we develop a study on several types of parallel genetic algorithms (PGAs). Our motivat...
International audienceThe flexible flow shop scheduling problem is an NP-hard problem and it require...
The flexible flow shop scheduling problem is an NP-hard problem and it requires significant resoluti...
International audienceGenetic Algorithms are commonly used to generate high-quality solutions to com...
In this paper, a hybrid genetic algorithm implemented in a grid environment to solve hard instances ...
International audienceIntegrating energy savings into production efficiency is considered as one ess...
International audienceDue to new government legislation, customers' environmental concerns and conti...
Determining an optimal schedule to m1mm1ze the completion time of the last job abandoning the system...
AbstractThe effort of searching an optimal solution for scheduling problems is important for real-wo...
Facility layout problem (FLP) is one of the hottest research areas in industrial engineering. A good...
Abstract: Flowshop scheduling problem is a kind of typical scheduling problem, and has wide applicat...
To deal with the multi-objective hybrid flow Shop Scheduling Problem (HFSP), an improved genetic alg...
Abstract. Genetic algorithms require relatively large computation time to solve optimization problem...
We propose a Genetic Algorithm for scheduling multiprocessor tasks in multi-stage flow-shop environm...
Task scheduling algorithms are designed mostly with the sole goal of minimizing makespan (completion...
In this paper we develop a study on several types of parallel genetic algorithms (PGAs). Our motivat...
International audienceThe flexible flow shop scheduling problem is an NP-hard problem and it require...
The flexible flow shop scheduling problem is an NP-hard problem and it requires significant resoluti...
International audienceGenetic Algorithms are commonly used to generate high-quality solutions to com...
In this paper, a hybrid genetic algorithm implemented in a grid environment to solve hard instances ...
International audienceIntegrating energy savings into production efficiency is considered as one ess...
International audienceDue to new government legislation, customers' environmental concerns and conti...
Determining an optimal schedule to m1mm1ze the completion time of the last job abandoning the system...
AbstractThe effort of searching an optimal solution for scheduling problems is important for real-wo...
Facility layout problem (FLP) is one of the hottest research areas in industrial engineering. A good...
Abstract: Flowshop scheduling problem is a kind of typical scheduling problem, and has wide applicat...
To deal with the multi-objective hybrid flow Shop Scheduling Problem (HFSP), an improved genetic alg...
Abstract. Genetic algorithms require relatively large computation time to solve optimization problem...
We propose a Genetic Algorithm for scheduling multiprocessor tasks in multi-stage flow-shop environm...
Task scheduling algorithms are designed mostly with the sole goal of minimizing makespan (completion...
In this paper we develop a study on several types of parallel genetic algorithms (PGAs). Our motivat...