Lower bounds for a multi-skill project scheduling problem. (English) Zbl 1306.90049

Klatte, Diethard (ed.) et al., Operations research proceedings 2011. Selected papers of the international conference on operations research (OR 2011), August 30 – September 2, 2011, Zurich, Switzerland. Berlin: Springer (ISBN 978-3-642-29209-5/pbk; 978-3-642-29210-1/ebook). Operations Research Proceedings, 471-476 (2012).
Summary: 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.
For the entire collection see [Zbl 1250.90010].


90B35 Deterministic scheduling theory in operations research


OFBiz Neogia; PSPLIB
Full Text: DOI