Detail publikace

Flexible Heuristics for Project Scheduling with Limited Resources

ŠEDA, M.

Anglický název

Flexible Heuristics for Project Scheduling with Limited Resources

Typ

Článek recenzovaný mimo WoS a Scopus

Jazyk

en

Originální abstrakt

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.

Klíčová slova anglicky

project management, resource-constrained scheduling, NP-hard problem, CPM, heuristic method

Vydáno

2007-10-01

ISSN

1307-6906

Časopis

International Journal of Applied Mathematics and Computer Science

Ročník

4

Číslo

4

Strany od–do

196–200

Počet stran

5

BIBTEX


@article{BUT44681,
  author="Miloš {Šeda}",
  title="Flexible Heuristics for Project Scheduling with Limited Resources",
  journal="International Journal of Applied Mathematics and Computer Science",
  year="2007",
  volume="4",
  number="4",
  pages="196--200",
  issn="1307-6906"
}