2012 | OriginalPaper | Chapter
Lower bounds for a multi-skill project scheduling problem
Authors : Cheikh Dhib, Anis Kooli, Ameur Soukhal, Emmanuel Néron
Published in: Operations Research Proceedings 2011
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The aim of this paper is to present lower bounds for a Multi-Skill Project Scheduling Problem, including some classical lower bounds and more enhanced ones. Starting from the lower bounds found in the literature, we focus on the particularity of our problem and on the adaptation of these lower bounds to our problem. We present preliminary results obtained with these new lower bounds. The adaptation of the time window adjustments used with energetic reasoning, shows the specificity of this problem, especially slack computation, which requires solving a max-flow with minimum cost problem.