Home > Research > Publications & Outputs > A compact reformulation of the two-stage robust...

Research

Associated organisational unit

Electronic data

  • paper

    Accepted author manuscript, 587 KB, PDF document

    Available under license: CC BY: Creative Commons Attribution 4.0 International License

Links

Text available via DOI:

Keywords

View graph of relations

A compact reformulation of the two-stage robust resource-constrained project scheduling problem

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

A compact reformulation of the two-stage robust resource-constrained project scheduling problem. / Bold, Matthew; Goerigk, Marc.
In: Computers and Operations Research, Vol. 130, 105232, 01.06.2021.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Bold, M & Goerigk, M 2021, 'A compact reformulation of the two-stage robust resource-constrained project scheduling problem', Computers and Operations Research, vol. 130, 105232. https://doi.org/10.1016/j.cor.2021.105232

APA

Bold, M., & Goerigk, M. (2021). A compact reformulation of the two-stage robust resource-constrained project scheduling problem. Computers and Operations Research, 130, Article 105232. https://doi.org/10.1016/j.cor.2021.105232

Vancouver

Bold M, Goerigk M. A compact reformulation of the two-stage robust resource-constrained project scheduling problem. Computers and Operations Research. 2021 Jun 1;130:105232. Epub 2021 Jan 23. doi: 10.1016/j.cor.2021.105232

Author

Bold, Matthew ; Goerigk, Marc. / A compact reformulation of the two-stage robust resource-constrained project scheduling problem. In: Computers and Operations Research. 2021 ; Vol. 130.

Bibtex

@article{4abdde6914fe46a5ad2248fe5c8d3f7f,
title = "A compact reformulation of the two-stage robust resource-constrained project scheduling problem",
abstract = "This paper considers the resource-constrained project scheduling problem with uncertain activity durations. We assume that activity durations lie in a budgeted uncertainty set, and follow a robust two-stage approach, where a decision maker must resolve resource conflicts subject to the problem uncertainty, but can determine activity start times after the uncertain activity durations become known. We introduce a new reformulation of the second-stage problem, which enables us to derive a compact robust counterpart to the full two-stage adjustable robust optimisation problem. Computational experiments show that this compact robust counterpart can be solved using standard optimisation software significantly faster than the current state-of-the-art algorithm for solving this problem, reaching optimality for almost 50% more instances on the same benchmark set.",
keywords = "project scheduling, Robust optimisation, resource constraints, budgeted uncertainty",
author = "Matthew Bold and Marc Goerigk",
year = "2021",
month = jun,
day = "1",
doi = "10.1016/j.cor.2021.105232",
language = "English",
volume = "130",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Ltd",

}

RIS

TY - JOUR

T1 - A compact reformulation of the two-stage robust resource-constrained project scheduling problem

AU - Bold, Matthew

AU - Goerigk, Marc

PY - 2021/6/1

Y1 - 2021/6/1

N2 - This paper considers the resource-constrained project scheduling problem with uncertain activity durations. We assume that activity durations lie in a budgeted uncertainty set, and follow a robust two-stage approach, where a decision maker must resolve resource conflicts subject to the problem uncertainty, but can determine activity start times after the uncertain activity durations become known. We introduce a new reformulation of the second-stage problem, which enables us to derive a compact robust counterpart to the full two-stage adjustable robust optimisation problem. Computational experiments show that this compact robust counterpart can be solved using standard optimisation software significantly faster than the current state-of-the-art algorithm for solving this problem, reaching optimality for almost 50% more instances on the same benchmark set.

AB - This paper considers the resource-constrained project scheduling problem with uncertain activity durations. We assume that activity durations lie in a budgeted uncertainty set, and follow a robust two-stage approach, where a decision maker must resolve resource conflicts subject to the problem uncertainty, but can determine activity start times after the uncertain activity durations become known. We introduce a new reformulation of the second-stage problem, which enables us to derive a compact robust counterpart to the full two-stage adjustable robust optimisation problem. Computational experiments show that this compact robust counterpart can be solved using standard optimisation software significantly faster than the current state-of-the-art algorithm for solving this problem, reaching optimality for almost 50% more instances on the same benchmark set.

KW - project scheduling

KW - Robust optimisation

KW - resource constraints

KW - budgeted uncertainty

U2 - 10.1016/j.cor.2021.105232

DO - 10.1016/j.cor.2021.105232

M3 - Journal article

VL - 130

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

M1 - 105232

ER -