Add to ORKGAbstract—In this paper we describe a tabu search based approach to the scheduling problem in project management and its integration in the LibrePlan open source software tool. A description of the key elements of the algorithm is provided, together with the execution of three use cases with LibrePlan, that shows how feasible plannings are obtained, achieving a noticeable reduction in the makespan of the projects
This paper considers a single machine scheduling problem of minimizing makespan (Cmax) which takes ...
In this paper we apply the tabu-search technique to the job shop scheduling problem , a notoriously ...
This paper investigates the resource-constrained project scheduling problem with alternative subgrap...
Abstract—In this paper we describe a tabu search based approach to the scheduling problem in project...
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...
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...
This paper addresses a practical scheduling problem arising in the packaging department of a pharmac...
In this study, the Single Resource-Constrained Project Scheduling Problem (SRCPSP) is considered. Th...
Project management has become a widespread instrument enabling organizations to efficiently master t...
International audienceThe scheduling problem under study may be viewed as an extension of the standa...
Real-time task scheduling problems are generally considered to be NP-hard problems. Therefore it is ...
Today, many enterprises in different industries take part in various projects, and organizational pe...
International audienceIn this paper, we propose an interactive method to solve a bi-objective resour...
This paper considers a single machine scheduling problem of minimizing makespan (Cmax) which takes ...
In this paper we apply the tabu-search technique to the job shop scheduling problem , a notoriously ...
This paper investigates the resource-constrained project scheduling problem with alternative subgrap...
Abstract—In this paper we describe a tabu search based approach to the scheduling problem in project...
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...
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...
This paper addresses a practical scheduling problem arising in the packaging department of a pharmac...
In this study, the Single Resource-Constrained Project Scheduling Problem (SRCPSP) is considered. Th...
Project management has become a widespread instrument enabling organizations to efficiently master t...
International audienceThe scheduling problem under study may be viewed as an extension of the standa...
Real-time task scheduling problems are generally considered to be NP-hard problems. Therefore it is ...
Today, many enterprises in different industries take part in various projects, and organizational pe...
International audienceIn this paper, we propose an interactive method to solve a bi-objective resour...
This paper considers a single machine scheduling problem of minimizing makespan (Cmax) which takes ...
In this paper we apply the tabu-search technique to the job shop scheduling problem , a notoriously ...
This paper investigates the resource-constrained project scheduling problem with alternative subgrap...