Due Dates and RCPSP
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.
KeywordsProject management due dates heuristics
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness, Management Science Research Project, Technical Report No. 43, UCLA.Google Scholar
- Kolisch, R. (1995). Project Scheduling under Resource Constraints-Efficient Heuristics for several Problem Classes, Phisica, Heidelberg.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar