A new RCPSP variant for scheduling research activities in a nuclear laboratory

Abstract : There are not many research works dedicated to the optimization of scheduling activities in research laboratories. In this paper, we consider the weekly scheduling problem of activities within a nuclear research laboratory. We show that this problem can be modeled as a preemptive multi-skill variant of the Resource-Constraint Project Scheduling Problem where the preemption of some activities is allowed and induces a penalty every time the activity is preempted. We propose two integer linear programs to find exact solutions. Computational tests are carried out and described.
Document type :
Conference papers
47th International Conference on Computers & Industrial Engineering (CIE47), Oct 2017, Lisbonne, Portugal. 8p., 2017
Liste complète des métadonnées

Cited literature [14 references]  Display  Hide  Download

https://hal.laas.fr/hal-01630977
Contributor : Pierre Lopez <>
Submitted on : Wednesday, November 8, 2017 - 5:31:47 PM
Last modification on : Thursday, January 11, 2018 - 2:07:26 AM

File

RCPSPNuclear.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01630977, version 1

Citation

Oliver Polo Mejia, Marie-Christine Anselmet, Christian Artigues, Pierre Lopez. A new RCPSP variant for scheduling research activities in a nuclear laboratory. 47th International Conference on Computers & Industrial Engineering (CIE47), Oct 2017, Lisbonne, Portugal. 8p., 2017. 〈hal-01630977〉

Share

Metrics

Record views

39

Files downloads

25