Abstract
Due dates are an essential feature of real projects, but little effort has been made in studying the RCPSP with due dates in the activities. This paper tries to bridge this gap by studying two problems: the TardinessRCPSP, in which the objective is total tardiness minimization and the DeadlineRCPSP, in which the due dates are strict (deadlines) and the objective is makespan minimization. The first problem is NP-hard and the second is much harder, since finding a feasible solution is already NP-hard. This paper has three objectives: Firstly to compare the performance on both problems of well-known RCPSP heuristics - priority rules, sampling procedures and metaheuristics - with new versions we have developed that take due dates into consideration. Secondly, to present an instance generator that can generate instances with loose, medium, and tight due dates for computational study. And, finally, to adapt the technique of justification to deal with due dates and deadlines and to show its profitability.
This is a preview of subscription content, log in via an institution to check access.
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
Ballestín, F. (2002). Nuevos métodos de resolución del problema de secuenciación de proyectos con recursos limitados, Unpublished PhD Dissertation, Universidad de Valencia.
Blazewicz, J., Lenstra, J.K., and Rinooy Kan, A.H.G. (1983). Scheduling subject to resource constraints: classification and complexity, Discrete Applied Mathematics, 5:11–24.
Brucker, P., Drexl, A., Möhring, R., Neumann K. and Pesch, E. (1999). Resource-constrained project scheduling: Notation, classification, models, and methods, European Journal of Operational Research, 112:3–41.
Dorigo, M., and Maniezzo, V. (1993). Parallel Genetic Algorithms: Introduction and Overview of Current Research, in: Parallel Genetic Algorithms: Theory & Applications, J. Stenders, ed., IOS Press, Amsterdam, pp. 5–42.
Garey, M. R., and Johnson, D. S. (1979). Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company. San Francisco.
Gordon, V., Proth, J-M., and Chu, C. (2002). A survey of the state-of-the art of common due date assignment and scheduling research, European Journal of Operational Research, 139:1–25.
Hartmann, S. (1998). A competitive genetic algorithm for resource-constrained project scheduling, Naval Research Logistics, 45:733–750.
Herroelen, W., Demeulemeester, E., and De Reyck, B. (1998). A Classification scheme for project scheduling, in: Project Scheduling. Recent Models, Algorithms and Applications, J. Weglarz, ed., Kluwer Academic Publishers, pp. 1–26.
Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness, Management Science Research Project, Technical Report No. 43, UCLA.
Kolisch, R. (1995). Project Scheduling under Resource Constraints-Efficient Heuristics for several Problem Classes, Phisica, Heidelberg.
Kolisch, R. (1996). Efficient priority rules for the resource-constrained project scheduling problem, Journal of Operations Management 14:179–192.
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 Hartmann, S. (1999). Heuristic algorithms for solving the resource-constrained, project scheduling problem: Classification and computational analysis, in: Project Scheduling. Recent Models, Algorithms and Applications, Weglarz, J., ed., Kluwer Academic Publishers, Boston, pp. 147–178.
Kolisch, R., and Sprecher, A. (1997). PSPLIB-A project scheduling library, European Journal of Operational Research, 96:205–216.
Koulamas, C. (1994). The total tardiness problem: Review and extensions, Operations Research, 42:1025–1041.
Li, KY., and Willis, RJ. (1992). An iterative scheduling technique for resource-constrained project scheduling, European Journal of Operational Research, 56:370–379.
Neumann, K., Schwindt, C., and Zimmermann, J. (2003). Project Scheduling with Time Windows and Scarce Resources, 2nd edition, Springer Verlag, Berlin.
Özdamar, L., and Ulusoy, G. (1996). An iterative local constraint based analysis for solving the resource constrained project scheduling problem, Journal of Operations Management, 14:193–208.
Schirmer, A., and Riesenberg, S. (1997). Parameterized Heuristics for Project Scheduling-Biased Random Sampling Methods, Technical report 456, Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel.
Thomas, P.R., and Salhi, S. (1997). An investigation into the relationship of heuristic performance with network-resource characteristics, Journal of the Operational Research Society, 48:34–43.
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., Ballestín, F., and Quintanilla, S. (2005a), Justification and RCPSP: a technique that pays, European Journal of Operational Research, 165:375–386.
Valls, V., Ballestín, F., and Quintanilla, S. (2006). Justification Technique Generalisations, in: Perspectives in Modern Project Scheduling, Józefowska J., and Weglarz J., eds, Kluwer, pp. 205–223.
Vanhoucke, M. (2002). Optimal due date assignment in project scheduling, Vlerick Leuven Gent Management School Working Paper Series 2002-19, Vlerick Leuven Gent Management School.
Vanhoucke, M., Demeulemeester, E., and Herroelen, W. (1999). Exact procedure for the unconstrained weighted earliness-tardiness project scheduling problem, Research Report. Department of Applied Economics, Katholieke Universiteit, Leuven, Belgium.
Vanhoucke, M., Demeulemeester, E., and Herroelen, W. (2001). Exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem, Annals of Operations Research, 102:179–196.
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
Ballestín, F., Valls, V., Quintanilla, S. (2006). Due Dates and RCPSP. 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_4
Download citation
DOI: https://doi.org/10.1007/978-0-387-33768-5_4
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)