Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alcaraz, J., and Maroto, C. (2001). A robust genetic algorithm for resource allocation in project scheduling, Annals of Operations Research, 102:83–109.
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.
Dorndorf, U., Pesch, E., and Phan-Huy, T. (2000). A branch-and-bound algorithm for the resource-constrained project scheduling problem, Mathematical Methods of Operations Research, 52:413–439.
Hartmann, S. (1998). A competitive genetic algorithm for resource-constrained project scheduling, Naval Research Logistics, 45:733–750.
Hartmann, S. (2002). A self-adapting genetic algorithm for project scheduling under resource constraints, Naval Research Logistics, 49(5):433–448.
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.
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.
Kolisch, R., and Sprecher, A. (1997). PSPLIB-A project scheduling library, European Journal of Operational Research, 96:205–216.
Li, KY., and Willis, RJ. (1992). An iterative scheduling technique for resource-constrained project scheduling, European Journal of Operational Research, 56:370–379.
Merkle, D., Middendorf, M., and Schmeck, H. (2002). Ant colony optimization for resource-constrained project scheduling, IEEE Transaction on Evolutionary Computation, 6:333–346.
Tormos, P., and Lova, A. (2001). A competitive heuristic solution technique for resource-constrained project scheduling, Annals of Operations Research, 102:65–81.
Valls, V., Quintanilla, S., and Ballestín, F. (2003a). Resource-constrained project scheduling: a critical activity reordering heuristic, European Journal of Operational Research, 149:282–301.
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.
Valls, V., Ballestín, F., and Quintanilla, S. (2004). A population-based approach to the resource-constrained project scheduling problem, Annals of Operations Research, 131:305–324.
Valls, V., Ballestín, F., and Quintanilla, S. (2005), Justification and RCPSP: a technique that pays, European Journal of Operational Research, 165:375–386.
Wiest, J D. (1964). Some properties of schedules for large projects with limited resources, Operations Research, 12:395–418.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Valls, V., Ballestín, F., Quintanilla, S. (2006). Justification Technique Generalizations. In: Józefowska, J., Weglarz, J. (eds) Perspectives in Modern Project Scheduling. International Series in Operations Research & Management Science, vol 92. Springer, Boston, MA . https://doi.org/10.1007/978-0-387-33768-5_8
Download citation
DOI: https://doi.org/10.1007/978-0-387-33768-5_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-33643-5
Online ISBN: 978-0-387-33768-5
eBook Packages: Business and EconomicsBusiness and Management (R0)