Add to ORKGIn the paper we propose a new framework for the distributed tabu search algorithm designed to be executed with the use of a multi-GPU cluster, in which cluster of nodes are equipped with multicore GPU computing units. The proposed methodology is designed specially to solve difficult discrete optimization problems, such as a flexible job shop scheduling problem, which we introduce as a case study used to analyze the efficiency of the designed synchronous algorithm
We discuss a parallel tabu search algorithm with implementation in a heterogeneous environment. Two ...
The scheduling departments of batch manufacturing plants have to repeatedly solve a complex scheduli...
This paper presents a tabu search approach for scheduling jobs on identical parallel machines with t...
In the paper we propose a new framework for the distributed tabu search algorithm designed to be exe...
AbstractWe propose the new framework of the distributed tabu search metaheuristic designed to be exe...
Abstract: Nowadays Personal Computers (PCs) are often equipped with powerful, multi-core CPU. Howeve...
There are many combinatorial optimization problems such as traveling salesman problem, quadratic-ass...
In this paper we study the following generalization of the job-shop scheduling problem. Each operati...
International audienceThe problem that we consider in this article is a flexible job shop scheduling...
In this paper, we discuss a parallel tabu search algorithm with implementation in a heterogeneous en...
This paper presents a new approach for parallel tabu search based on adaptive parallelism. Adaptive ...
International audienceThis paper deals with a general job shop scheduling problem with multiple cons...
In the multiprocessor open shop scheduling problem, jobs are to be processed on a set of processing ...
In the multiprocessor open shop scheduling problem, jobs are to be processed on a set of processing ...
This paper presents two Tabu Search type algorithms for solving the multiprocessor scheduling proble...
We discuss a parallel tabu search algorithm with implementation in a heterogeneous environment. Two ...
The scheduling departments of batch manufacturing plants have to repeatedly solve a complex scheduli...
This paper presents a tabu search approach for scheduling jobs on identical parallel machines with t...
In the paper we propose a new framework for the distributed tabu search algorithm designed to be exe...
AbstractWe propose the new framework of the distributed tabu search metaheuristic designed to be exe...
Abstract: Nowadays Personal Computers (PCs) are often equipped with powerful, multi-core CPU. Howeve...
There are many combinatorial optimization problems such as traveling salesman problem, quadratic-ass...
In this paper we study the following generalization of the job-shop scheduling problem. Each operati...
International audienceThe problem that we consider in this article is a flexible job shop scheduling...
In this paper, we discuss a parallel tabu search algorithm with implementation in a heterogeneous en...
This paper presents a new approach for parallel tabu search based on adaptive parallelism. Adaptive ...
International audienceThis paper deals with a general job shop scheduling problem with multiple cons...
In the multiprocessor open shop scheduling problem, jobs are to be processed on a set of processing ...
In the multiprocessor open shop scheduling problem, jobs are to be processed on a set of processing ...
This paper presents two Tabu Search type algorithms for solving the multiprocessor scheduling proble...
We discuss a parallel tabu search algorithm with implementation in a heterogeneous environment. Two ...
The scheduling departments of batch manufacturing plants have to repeatedly solve a complex scheduli...
This paper presents a tabu search approach for scheduling jobs on identical parallel machines with t...