Time-Varying Resource Requirements and Capacities

Sönke Hartmann ()
Additional contact information
Sönke Hartmann: HSBA Hamburg School of Business Administration

Chapter Chapter 8 in Handbook on Project Management and Scheduling Vol.1, 2015, pp 163-176 from Springer

Abstract: Abstract This contribution discusses an extension of the classical resource-constrained project scheduling problem (RCPSP) in which the resource requests of the activities and the resource capacities may change over time. We present relationships to other variants of the RCPSP as well as some applications of this problem setting. Subsequently, we analyze the applicability of heuristics which were originally developed for the standard RCPSP and adapt one of them, a genetic algorithm, to this extension. The chapter closes with a few computational results and some remarks on research perspectives.

Keywords: Genetic algorithm; Makespan minimization; Project scheduling; Time-varying resource constraints (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (8)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:ihichp:978-3-319-05443-8_8

Ordering information: This item can be ordered from
http://www.springer.com/9783319054438

DOI: 10.1007/978-3-319-05443-8_8

Access Statistics for this chapter

More chapters in International Handbooks on Information Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().