Methods to solve multi-skill project scheduling problem |
| |
Authors: | Odile Bellenguez-Morineau |
| |
Affiliation: | 1.Laboratoire d’Informatique,Université Fran?ois-Rabelais de Tours,Tours,France |
| |
Abstract: | This is a summary of the author’s PhD thesis supervised by P. Martineau and E. Néron and defended on 28 November 2006 at the Université François-Rabelais de Tours. The thesis is written in French, and is available upon request from the author. This work deals with the problem of scheduling a project. The activities of this project requires skills that may not be mastered by all persons involved. First of all, the problem is defined in the introduction part. Then we propose different methods to solve it: lower bounds in part 2, different heuristics and meta-heuristics in part 3, and finally a branch-and-bound procedure in the last part. |
| |
Keywords: | Project scheduling Tabu search Lower bounds Branch-and-bound procedure |
本文献已被 SpringerLink 等数据库收录! |