Lower bounds for the multi-skill project scheduling problem with hierarchical levels of skills

  • Authors:
  • Odile Bellenguez;Emmanuel Néron

  • Affiliations:
  • Laboratoire d'Informatique de l'Université de Tours, Tours, France;Laboratoire d'Informatique de l'Université de Tours, Tours, France

  • Venue:
  • PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we introduce an extension of the classical Resource-Constrained Project Scheduling Problem: the Multi-skill Project Scheduling Problem. We consider a project made up of activities that must be implemented by a staff: every member of this staff masters one or more skill(s). An activity needs a given amount of each skill with a fixed minimum level of mastering. For each unit of a skill needed, we have to assign an employee who masters the required level of this skill during the whole processing time of the activity. The objective is to minimize the duration of the project, i.e. the makespan. We introduce here two lower bounds used to evaluate the minimum duration.