Skip to main content
Log in

Methods to solve multi-skill project scheduling problem

  • PhD Thesis
  • Published:
4OR Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Baptiste Ph, Le Pape C, Nuitjen W (1999) Satisfiability tests and time-bound adjustments for cumulative scheduling problems. Ann Oper Res 92:305–333

    Article  Google Scholar 

  • Bellenguez O, Néron E (2004) Methods for solving the multi-skill project scheduling problem. Ninth international workshop on project management and scheduling, Nancy, pp 66–69

  • Bellenguez O, Néron E (2005) Lower bounds for the multi-skill project scheduling problem with hierarchical levels of skills. Lecture Notes in Computer Science 3616/2005: Practice and Theory of Automated Timetabling V: 5th international conference, PATAT 2004, Pittsburgh, PA, USA, August 18–20, 2004, Revised Selected Papers, Springer, pp 229–243

  • Bellenguez-Morineau O, Néron E (2006) A branch-and-bound method for solving multi-skill project scheduling problem. RAIRO-RO (in press)

  • Carlier J, Latapie B (1991) Une méthode arborescente pour résoudre les problèmes cumulatifs. RAIRO-RO 25(3):311–340

    Google Scholar 

  • Klein R (2000) Scheduling of resource-constrained projects. Kluwer, Dordrecht

    Google Scholar 

  • Kolen AWJ, Kroon LG (1991) On the computational complexity of (maximum) class scheduling. Eur J Oper Res 54:23–28

    Article  Google Scholar 

  • Mingozzi A, Maniezzo V, Riciardelli S, Bianco L (1998) An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation. Manage Sci 44(5):714–729

    Article  Google Scholar 

  • Néron E, Baptiste Ph, Gupta JND (2001) Solving an hybrid flow shop problem using energetic reasoning and global operrations. Omega 29:501–511

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Odile Bellenguez-Morineau.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bellenguez-Morineau, O. Methods to solve multi-skill project scheduling problem. 4OR 6, 85–88 (2008). https://doi.org/10.1007/s10288-007-0038-4

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-007-0038-4

Keywords

MSC Classification

Navigation