Justification Technique Generalizations
The justification technique was introduced various decades ago for the resource-constrained project scheduling problem, although it has rarely been used with the problem. Justification is a simple and quick technique which when applied to schedules produces a new schedule that is, at most, as long as the original schedule — and often shorter. A recent article (Valls et al, 2005), showed that incorporating justification in heuristic algorithms can produce a substancial improvement in the results obtained. These results have motivated us to generalise this technique in order to study it in greater depth. This paper proposes distinct forms and generalisations for the justification technique and studies the relation existing among sets of obtainable schedules. The obtained results show that the proposed generalisations are worthwhile. Several computational tests have been performed to ascertain the impact of the generalisations on algorithmic efficiency.
Keywordsresource constrained project scheduling justification heuristics
Unable to display preview. Download preview PDF.
- Ballestín, F., Vails, V., and Quintanilla, S. (2006). Due Dates and RCPSP, in: Perspectives in Modern Project Scheduling, J. Józefowska and J. Weglarz, eds, Kluwer, pp. 79–104.Google Scholar
- Kochetov, Y., and Stolyar, A. (2003). Evolutionary local search with variable neighborhood for the resource constrained project scheduling problem, in: Proceedings of the 3rd International Workshop of Computer Science and Information Technologies.Google Scholar
- Kolisch, R., Sprecher, A., and Drexl, A. (1995). Characterization and generation of a general class of resource-constrained project scheduling problems, Management Science, 41:1693–1703.Google Scholar
- Valls, V., Ballestín, F., and Quintanilla, S. (2003b). A hybrid genetic algorithm for the RCPSP. Technical Report, Departamento de Estadística e Investi-gación Operativa, Universidad de Valencia.Google Scholar