About: A Flexible Heuristic Algorithm for Resource-Constrained Project Scheduling

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: A Flexible Heuristic Algorithm for Resource-Constrained Project Scheduling Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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 on priorities 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. 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 on priorities 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. (en)
Title	A Flexible Heuristic Algorithm for Resource-Constrained Project Scheduling A Flexible Heuristic Algorithm for Resource-Constrained Project Scheduling (en)
skos:prefLabel	A Flexible Heuristic Algorithm for Resource-Constrained Project Scheduling A Flexible Heuristic Algorithm for Resource-Constrained Project Scheduling (en)
skos:notation	RIV/00216305:26210/09:PU86339!RIV10-MSM-26210___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GA102/09/1680), Z(MSM0021630529)
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Šeda, Miloš Matoušek, Radomil Šandera, Čeněk Pivoňka, Petr Ošmera, Pavel
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoké učení technické v Brně / Fakulta strojního inženýrství
http://linked.open...dnocenehoVysledku	301265
http://linked.open...ai/riv/idVysledku	RIV/00216305:26210/09:PU86339
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	project management, resource-constrained scheduling, NP-hard problem, CPM, heuristic method. (en)
http://linked.open.../riv/klicoveSlovo	project management heuristic method. resource-constrained scheduling NP-hard problem CPM
http://linked.open...ontrolniKodProRIV	[10D0C42D6FAA]
http://linked.open...v/mistoKonaniAkce	San Francisco
http://linked.open...i/riv/mistoVydani	San Francisco, USA
http://linked.open...i/riv/nazevZdroje	World Congress on Engineering and Computer Science 2009
http://linked.open...in/vavai/riv/obor	BB
http://linked.open...ichTvurcuVysledku	5 (xsd:int)
http://linked.open...cetTvurcuVysledku	5 (xsd:int)
http://linked.open...vavai/riv/projekt	Control Algorithm Design by Means of Evolutionary Approach
http://linked.open...UplatneniVysledku	2009
http://linked.open...iv/tvurceVysledku	Matoušek, Radomil Pivoňka, Petr Šandera, Čeněk Šeda, Miloš Ošmera, Pavel
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2009-10-20 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Inteligentní systémy v automatizaci
number of pages	5 (xsd:int)
http://purl.org/ne...btex#hasPublisher	IAENG
https://schema.org/isbn	978-988-18210-2-7
http://localhost/t...ganizacniJednotka	26210
is http://linked.open...avai/riv/vysledek of	A Flexible Heuristic Algorithm for Resource-Constrained Project Scheduling A Flexible Heuristic Algorithm for Resource-Constrained Project Scheduling A Flexible Heuristic Algorithm for Resource-Constrained Project Scheduling A Flexible Heuristic Algorithm for Resource-Constrained Project Scheduling

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 47 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software