Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikace
ŠEDA, M.
Originální název
A Contribution to Shift Algorithms for Resource-Constrained Scheduling with Dynamic Changes
Typ
článek ve sborníku ve WoS nebo Scopus
Jazyk
angličtina
Originální abstrakt
Project scheduling with limited resources 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 also be used if the durations are changed as a result of process implementation.
Klíčová slova
resource-constrained scheduling, project management, NP-hard problem, CPM, heuristic method
Autoři
Rok RIV
2007
Vydáno
1. 7. 2007
Nakladatel
WSEAS Press
Místo
Crete Island (Greece)
ISBN
978-960-8457-90-4
Kniha
Proceedings of the 11th WSEAS International Conference on Systems
Strany od
401
Strany do
405
Strany počet
5
BibTex
@inproceedings{BUT23384, author="Miloš {Šeda}", title="A Contribution to Shift Algorithms for Resource-Constrained Scheduling with Dynamic Changes", booktitle="Proceedings of the 11th WSEAS International Conference on Systems", year="2007", pages="401--405", publisher="WSEAS Press", address="Crete Island (Greece)", isbn="978-960-8457-90-4" }