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.

[1]  Andreas Schirmer,et al.  Parameterized heuristics for project scheduling: Biased random sampling methods , 1997 .

[2]  Christos Koulamas,et al.  The Total Tardiness Problem: Review and Extensions , 1994, Oper. Res..

[3]  Erik Demeulemeester,et al.  An Exact Procedure for the Resource-Constrained Weighted Earliness–Tardiness Project Scheduling Problem , 2001, Ann. Oper. Res..

[4]  Rainer Kolisch,et al.  Efficient priority rules for the resource-constrained project scheduling problem , 1996 .

[5]  Rainer Kolisch,et al.  Project Scheduling under Resource Constraints: Efficient Heuristics for Several Problem Classes , 1995 .

[6]  Gündüz Ulusoy,et al.  An iterative local constraints based analysis for solving the resource constrained project scheduling problem , 1996 .

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Joachim Stender,et al.  Parallel Genetic Algorithms: Introduction and Overview of Current Research , 1993 .

[9]  Robert J Willis,et al.  An iterative scheduling technique for resource-constrained project scheduling , 1992 .

[10]  Sönke Hartmann,et al.  A competitive genetic algorithm for resource-constrained project scheduling , 1998 .

[11]  Rainer Kolisch,et al.  PSPLIB - A project scheduling problem library: OR Software - ORSEP Operations Research Software Exchange Program , 1997 .

[12]  Rainer Kolisch,et al.  Characterization and generation of a general class of resource-constrained project scheduling problems , 1995 .

[13]  María Pilar Tormos,et al.  A Competitive Heuristic Solution Technique for Resource-Constrained Project Scheduling , 2001, Ann. Oper. Res..

[14]  Erik Demeulemeester,et al.  A classification scheme for project scheduling , 1999 .

[15]  R. Kolisch,et al.  Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis , 1999 .

[16]  Professor Dr. Klaus Neumann,et al.  Project Scheduling with Time Windows and Scarce Resources , 2003, Springer Berlin Heidelberg.

[17]  Rainer Kolisch,et al.  Project Scheduling under Resource Constraints , 1995 .

[18]  Rolf H. Möhring,et al.  Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

[19]  Francisco Ballestín,et al.  Justification and RCPSP: A technique that pays , 2005, Eur. J. Oper. Res..

[20]  Francisco Ballestín González.  Nuevos métodos de resolución del problema de secuenciación de proyectos con recursos limitados. , 2002 .

[21]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

[22]  Chengbin Chu,et al.  A survey of the state-of-the-art of common due date assignment and scheduling research , 2002, Eur. J. Oper. Res..

[23]  Said Salhi,et al.  An investigation into the relationship of heuristic performance with network-resource characteristics , 1997 .