A Flexible Heuristic Algorithm for Resource-Constrained Project Scheduling
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F09%3APU86339" target="_blank" >RIV/00216305:26210/09:PU86339 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A Flexible Heuristic Algorithm for Resource-Constrained Project Scheduling
Original language description
Resource-constrained project scheduling is an NP-hard optimisation problem. There are many different heuristic strategies how to shift activities in time when resource requirements exceed their available amounts. These strategies are frequently based onpriorities of activities. In this paper, we assume that a suitable heuristic has been chosen to decide which activities should be performed immediately and which should be postponed and investigate the resource-constrained project scheduling problem (RCPSP) from the implementation point of view. We propose an efficient routine that, instead of shifting the activities, extends their duration. It makes it possible to break down their duration into active and sleeping subintervals. Then we can apply the classical Critical Path Method that needs only polynomial running time. This algorithm can simply be adapted for multiproject scheduling with limited resources.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA102%2F09%2F1680" target="_blank" >GA102/09/1680: Control Algorithm Design by Means of Evolutionary Approach</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
World Congress on Engineering and Computer Science 2009
ISBN
978-988-18210-2-7
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
—
Publisher name
IAENG
Place of publication
San Francisco, USA
Event location
San Francisco
Event date
Oct 20, 2009
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—