Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-29210-1_75 | Operations Research Proceedings |
Field | DocType | ISSN |
Project scheduling problem,Mathematical optimization,Multiprocessor scheduling,Nurse scheduling problem,Rate-monotonic scheduling,Dynamic priority scheduling,Mathematics,Computation | Conference | 0721-5924 |
Citations | PageRank | References |
1 | 0.36 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cheikh Dhib | 1 | 1 | 0.36 |
| Anis Kooli | 2 | 12 | 2.07 |
| Ameur Soukhal | 3 | 119 | 10.15 |
| Emmanuel Néron | 4 | 150 | 11.68 |