International audience An appropriate tabu search implementation is designed to solve the resource constrained project scheduling problem. This approach uses well defined move strategies and a structured neighbourhood, defines appropriate tabu status and tenure and takes account of objective function approximation to speed up the search process. A sound understanding of the problem has helped in many ways in designing and enhancing the tabu search methodology. The method uses diversification, intensification and handles infeasibility via strategic oscillation
The paper presents the problem of optimal management of the resources in multiunit construction proj...
[[abstract]]This study considers production planning problems involving multiple products, multiple ...
Real-time task scheduling problems are generally considered to be NP-hard problems. Therefore it is ...
International audience An appropriate tabu search implementation is designed to solve the resource c...
An appropriate tabu search implementation is designed to solve the resource constrained project sche...
International audienceThe scheduling problem under study may be viewed as an extension of the standa...
In this study, the Single Resource-Constrained Project Scheduling Problem (SRCPSP) is considered. Th...
When the project is scheduled with a given set of resources, it is difficult to find the optimal sol...
The Resource Constrained Project Scheduling Problem (RCPS) is a well known difficult combinatorial o...
International audienceIn this paper, we propose an interactive method to solve a bi-objective resour...
Most of multiple criteria scheduling problems are NP-hard, so that exact procedures can only solve s...
This paper presents a tabu search approach for the job-shop scheduling problem. Although the problem...
International audienceThe problem that we consider in this article is a flexible job shop scheduling...
Abstract—In this paper we describe a tabu search based approach to the scheduling problem in project...
Construction practice often involves such cases which include completion of a number of civil struct...
The paper presents the problem of optimal management of the resources in multiunit construction proj...
[[abstract]]This study considers production planning problems involving multiple products, multiple ...
Real-time task scheduling problems are generally considered to be NP-hard problems. Therefore it is ...
International audience An appropriate tabu search implementation is designed to solve the resource c...
An appropriate tabu search implementation is designed to solve the resource constrained project sche...
International audienceThe scheduling problem under study may be viewed as an extension of the standa...
In this study, the Single Resource-Constrained Project Scheduling Problem (SRCPSP) is considered. Th...
When the project is scheduled with a given set of resources, it is difficult to find the optimal sol...
The Resource Constrained Project Scheduling Problem (RCPS) is a well known difficult combinatorial o...
International audienceIn this paper, we propose an interactive method to solve a bi-objective resour...
Most of multiple criteria scheduling problems are NP-hard, so that exact procedures can only solve s...
This paper presents a tabu search approach for the job-shop scheduling problem. Although the problem...
International audienceThe problem that we consider in this article is a flexible job shop scheduling...
Abstract—In this paper we describe a tabu search based approach to the scheduling problem in project...
Construction practice often involves such cases which include completion of a number of civil struct...
The paper presents the problem of optimal management of the resources in multiunit construction proj...
[[abstract]]This study considers production planning problems involving multiple products, multiple ...
Real-time task scheduling problems are generally considered to be NP-hard problems. Therefore it is ...