Lower bounds for a multi-skill project scheduling problem

Cheikh Dhib (), Anis Kooli (), Ameur Soukhal () and Emmanuel Néron ()
Additional contact information
Cheikh Dhib: University of Tours
Anis Kooli: Combinatorial Optimization Research Group - ROI, Ecole Polytechnique de Tunisie
Ameur Soukhal: University of Tours
Emmanuel Néron: University of Tours

A chapter in Operations Research Proceedings 2011, 2012, pp 471-476 from Springer

Abstract: Abstract 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.

Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-642-29210-1_75

Ordering information: This item can be ordered from
http://www.springer.com/9783642292101

DOI: 10.1007/978-3-642-29210-1_75

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().