Skip to Main content Skip to Navigation
Theses

New methods for the multi-skills project scheduling problem

Abstract : In this Phd Thesis we introduce several procedures to solve the Multi-Skill Project Scheduling Problem (MSPSP). The aim is to find a schedule that minimizes the completion time (makespan) of a project, composed of a set of activities. Precedence relations and resource constraints are considered. In this problem, resources are staff members that master several skills. Thus, a given number of workers must be assigned to perform each skill required by an activity. Furthermore, we give a particula rimportance to exact methods for solving the Multi-Skill Project Scheduling Problem (MSPSP), since there are still several instances for which optimality is still to be proven. Nevertheless, with the purpose of solving big sized instances we also developed and implemented a heuristic approach.
Document type :
Theses
Complete list of metadatas

Cited literature [117 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00789769
Contributor : Abes Star :  Contact
Submitted on : Monday, February 18, 2013 - 5:22:12 PM
Last modification on : Wednesday, December 19, 2018 - 3:02:04 PM
Long-term archiving on: : Sunday, May 19, 2013 - 4:05:31 AM

File

Montoya_C_12_2012.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-00789769, version 1

Citation

Carlos Eduardo Montoya Casas. New methods for the multi-skills project scheduling problem. Automatic Control Engineering. Ecole des Mines de Nantes, 2012. English. ⟨NNT : 2012EMNA0077⟩. ⟨tel-00789769⟩

Share

Metrics

Record views

966

Files downloads

2387