%0 Journal Article
	%A Miloš Šeda
	%D 2007
	%J International Journal of Mechanical and Mechatronics Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 6, 2007
	%T Flexible Heuristics for Project Scheduling with Limited Resources
	%U https://publications.waset.org/pdf/7847
	%V 6
	%X Resource-constrained project scheduling is an NPhard
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.
	%P 1544 - 1548