New strategies for stochastic resource-constrained project scheduling

Salim Rostami, Stefan Creemers and Roel Leus
Additional contact information
Stefan Creemers: LEM - Lille économie management - UMR 9221 - UA - Université d'Artois - UCL - Université catholique de Lille - Université de Lille - CNRS - Centre National de la Recherche Scientifique
Roel Leus: KU Leuven - Catholic University of Leuven = Katholieke Universiteit Leuven

Post-Print from HAL

Abstract: We study the stochastic resource-constrained project scheduling problem or SRCPSP, where project activities have stochastic durations. A solution is a scheduling policy, and we propose a new class of policies that is a generalization of most of the classes described in the literature. A policy in this new class makes a number of a priori decisions in a preprocessing phase, while the remaining scheduling decisions are made online. A two-phase local search algorithm is proposed to optimize within the class. Our computational results show that the algorithm has been efficiently tuned toward finding high-quality solutions and that it outperforms all existing algorithms for large instances. The results also indicate that the optimality gap even within the larger class of elementary policies is very small.

Date: 2017-01-12
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Published in Journal of Scheduling, 2017, 21, pp.349-365. ⟨10.1007/s10951-016-0505-x⟩

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:hal:journl:hal-01745268

DOI: 10.1007/s10951-016-0505-x

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().