Profit-oriented scheduling of resource-constrained projects with flexible capacity constraints

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Autoren

  • André Schnabel
  • Carolin Kellenbrink
  • Stefan Helber
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Seiten (von - bis)329-356
Seitenumfang28
FachzeitschriftBusiness Research
Jahrgang11
Ausgabenummer2
Frühes Online-Datum22 Mai 2018
PublikationsstatusVeröffentlicht - Sept. 2018

Abstract

We consider a novel generalization of the resource-constrained project scheduling problem (RCPSP). Unlike many established approaches for the RCPSP that aim to minimize the makespan of the project for given static capacity constraints, we consider the important real-life aspect that capacity constraints can often be systematically modified by temporarily assigning costly additional production resources or using overtime. We, furthermore, assume that the revenue of the project decreases as its makespan increases and try to find a schedule with a profit-maximizing makespan. Like the RCPSP, the problem is NP-hard, but unlike the RCPSP, it turns out that an optimal schedule does not have to be among the set of so-called active schedules. Scheduling such a project is a formidable task, both from a practical and a theoretical perspective. We develop, describe, and evaluate alternative solution encodings and schedule decoding mechanisms to solve this problem within a genetic algorithm framework and we compare the solutions obtained to both optimal reference values and the results of a commercial local search solver called LocalSolver.

ASJC Scopus Sachgebiete

Zitieren

Profit-oriented scheduling of resource-constrained projects with flexible capacity constraints. / Schnabel, André; Kellenbrink, Carolin; Helber, Stefan.
in: Business Research, Jahrgang 11, Nr. 2, 09.2018, S. 329-356.

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Schnabel A, Kellenbrink C, Helber S. Profit-oriented scheduling of resource-constrained projects with flexible capacity constraints. Business Research. 2018 Sep;11(2):329-356. Epub 2018 Mai 22. doi: 10.1007/s40685-018-0063-5, 10.15488/5030
Schnabel, André ; Kellenbrink, Carolin ; Helber, Stefan. / Profit-oriented scheduling of resource-constrained projects with flexible capacity constraints. in: Business Research. 2018 ; Jahrgang 11, Nr. 2. S. 329-356.
Download
@article{682f4d13e39f4ef7a9d58e5e55f51a8b,
title = "Profit-oriented scheduling of resource-constrained projects with flexible capacity constraints",
abstract = "We consider a novel generalization of the resource-constrained project scheduling problem (RCPSP). Unlike many established approaches for the RCPSP that aim to minimize the makespan of the project for given static capacity constraints, we consider the important real-life aspect that capacity constraints can often be systematically modified by temporarily assigning costly additional production resources or using overtime. We, furthermore, assume that the revenue of the project decreases as its makespan increases and try to find a schedule with a profit-maximizing makespan. Like the RCPSP, the problem is NP-hard, but unlike the RCPSP, it turns out that an optimal schedule does not have to be among the set of so-called active schedules. Scheduling such a project is a formidable task, both from a practical and a theoretical perspective. We develop, describe, and evaluate alternative solution encodings and schedule decoding mechanisms to solve this problem within a genetic algorithm framework and we compare the solutions obtained to both optimal reference values and the results of a commercial local search solver called LocalSolver.",
keywords = "Encodings, Genetic algorithm, Heuristics, Local-search, Overtime, Project scheduling, RCPSP",
author = "Andr{\'e} Schnabel and Carolin Kellenbrink and Stefan Helber",
note = "Funding Information: Acknowledgements The authors thank the German Research Foundation (DFG) for financial support of this research project in the CRC 871 {\textquoteleft}{\textquoteleft}Regeneration of complex durable goods{\textquoteright}{\textquoteright}.",
year = "2018",
month = sep,
doi = "10.1007/s40685-018-0063-5",
language = "English",
volume = "11",
pages = "329--356",
number = "2",

}

Download

TY - JOUR

T1 - Profit-oriented scheduling of resource-constrained projects with flexible capacity constraints

AU - Schnabel, André

AU - Kellenbrink, Carolin

AU - Helber, Stefan

N1 - Funding Information: Acknowledgements The authors thank the German Research Foundation (DFG) for financial support of this research project in the CRC 871 ‘‘Regeneration of complex durable goods’’.

PY - 2018/9

Y1 - 2018/9

N2 - We consider a novel generalization of the resource-constrained project scheduling problem (RCPSP). Unlike many established approaches for the RCPSP that aim to minimize the makespan of the project for given static capacity constraints, we consider the important real-life aspect that capacity constraints can often be systematically modified by temporarily assigning costly additional production resources or using overtime. We, furthermore, assume that the revenue of the project decreases as its makespan increases and try to find a schedule with a profit-maximizing makespan. Like the RCPSP, the problem is NP-hard, but unlike the RCPSP, it turns out that an optimal schedule does not have to be among the set of so-called active schedules. Scheduling such a project is a formidable task, both from a practical and a theoretical perspective. We develop, describe, and evaluate alternative solution encodings and schedule decoding mechanisms to solve this problem within a genetic algorithm framework and we compare the solutions obtained to both optimal reference values and the results of a commercial local search solver called LocalSolver.

AB - We consider a novel generalization of the resource-constrained project scheduling problem (RCPSP). Unlike many established approaches for the RCPSP that aim to minimize the makespan of the project for given static capacity constraints, we consider the important real-life aspect that capacity constraints can often be systematically modified by temporarily assigning costly additional production resources or using overtime. We, furthermore, assume that the revenue of the project decreases as its makespan increases and try to find a schedule with a profit-maximizing makespan. Like the RCPSP, the problem is NP-hard, but unlike the RCPSP, it turns out that an optimal schedule does not have to be among the set of so-called active schedules. Scheduling such a project is a formidable task, both from a practical and a theoretical perspective. We develop, describe, and evaluate alternative solution encodings and schedule decoding mechanisms to solve this problem within a genetic algorithm framework and we compare the solutions obtained to both optimal reference values and the results of a commercial local search solver called LocalSolver.

KW - Encodings

KW - Genetic algorithm

KW - Heuristics

KW - Local-search

KW - Overtime

KW - Project scheduling

KW - RCPSP

UR - http://www.scopus.com/inward/record.url?scp=85058507779&partnerID=8YFLogxK

U2 - 10.1007/s40685-018-0063-5

DO - 10.1007/s40685-018-0063-5

M3 - Article

VL - 11

SP - 329

EP - 356

JO - Business Research

JF - Business Research

SN - 2198-3402

IS - 2

ER -