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

Show simple item record

dc.identifier.uri http://dx.doi.org/10.15488/5030
dc.identifier.uri https://www.repo.uni-hannover.de/handle/123456789/5074
dc.contributor.author Schnabel, André
dc.contributor.author Kellenbrink, Carolin
dc.contributor.author Helber, Stefan
dc.date.accessioned 2019-06-26T12:57:10Z
dc.date.available 2019-06-26T12:57:10Z
dc.date.issued 2018
dc.identifier.citation Schnabel, André; Kellenbrink, Carolin; Helber, Stefan : Profit-oriented scheduling of resource-constrained projects with flexible capacity constraints. In: Business Research 11 (2018), Nr. 2, S. 329-356. DOI: https://doi.org/10.1007/s40685-018-0063-5
dc.description.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 \(\mathcal {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. eng
dc.language.iso eng
dc.publisher Heidelberg : Springer
dc.relation.ispartofseries Business Research 11 (2018), Nr. 2
dc.rights CC BY 4.0
dc.rights.uri https://creativecommons.org/licenses/by/4.0/
dc.subject Scheduling (computing) eng
dc.subject Mathematical optimization eng
dc.subject Heuristics eng
dc.subject Local search (optimization) eng
dc.subject Economics eng
dc.subject Solver eng
dc.subject Schedule (project management) eng
dc.subject Management science eng
dc.subject Job shop scheduling eng
dc.subject Schedule eng
dc.subject Genetic algorithm eng
dc.subject.ddc 650 | Management ger
dc.title Profit-oriented scheduling of resource-constrained projects with flexible capacity constraints
dc.type article
dc.type Text
dc.relation.issn 2198-3402
dc.relation.doi https://doi.org/10.1007/s40685-018-0063-5
dc.bibliographicCitation.issue 2
dc.bibliographicCitation.volume 11
dc.bibliographicCitation.firstPage 329
dc.bibliographicCitation.lastPage 356
dc.description.version publishedVersion
tib.accessRights frei zug�nglich


Files in this item

This item appears in the following Collection(s):

Show simple item record

 

Search the repository


Browse

My Account

Usage Statistics