| Summary: | Recently, in the field of project scheduling problems the concept of partially renewable
resources has been introduced. Theoretically, it is a generalization of both renewable and non-renewable resources. From an applied point of view, partially renewable
resources allow us to model a large variety of situations that do not fit into
classical models, but can be found in real problems in timetabling and labour scheduling.
When modelling real problems, the problem of project scheduling with partially
renewable resources, as many other combinatorial problems, gets such large dimensions
that it is quite difficult to apply solution procedures. In this paper, we describe
some powerful preprocessing techniques that reduce significantly the dimension of the
problems and therefore improve the efficiency of any algorithm used for solving them.
The paper shows the excellent results obtained by these techniques on a set of test
instance taken from the literature.
Keywords: Project Scheduling, Preprocessing, Partially Renewable Resources.
|
|---|