Report
A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem
| العنوان: | A faster exact method for solving the robust multi-mode resource-constrained project scheduling problem |
|---|---|
| المؤلفون: | Bold, Matthew, Goerigk, Marc |
| سنة النشر: | 2022 |
| المجموعة: | Computer Science Mathematics |
| مصطلحات موضوعية: | Mathematics - Optimization and Control, Computer Science - Discrete Mathematics |
| الوصف: | 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. Comment: 14 pages, 4 figures. In submission at Operations Research Letters |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2203.06983 |
| رقم الانضمام: | edsarx.2203.06983 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |