A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem

Bold, M. and Goerigk, M. (2022) A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem. Operations Research Letters, 50 (5). pp. 581-587. ISSN 0167-6377

Full text not available from this repository.

Abstract

This paper presents a mixed-integer linear programming formulation for the multi-mode resource-constrained project scheduling problem with uncertain activity durations. We consider a two-stage robust optimisation approach and find solutions that minimise the worst-case project makespan, whilst assuming that activity durations lie in a budgeted uncertainty set. Computational experiments show that this easy-to-implement formulation is many times faster than the current state-of-the-art solution approach for this problem, whilst solving over 40% more instances to optimality over the same benchmarking set. © 2022 The Author(s)

Item Type:
Journal Article
Journal or Publication Title:
Operations Research Letters
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2200/2209
Subjects:
ID Code:
176818
Deposited By:
Deposited On:
03 Oct 2022 15:50
Refereed?:
Yes
Published?:
Published
Last Modified:
22 Nov 2022 11:53