Resource constrained project scheduling problem with discounted earliness-tardiness penalties: Mathematical modeling and solving procedure

In this paper, we consider the resource-constrained project scheduling problem with a due date for each activity. The objective is to minimize the net present value of the earliness-tardiness penalty costs. The problem is first mathematically modeled. Then, two meta-heuristics, genetic algorithm and simulated annealing are proposed to solve this strongly NP-hard problem. Design of experiments and response surface methodology are employed to fine-tune the meta-heuristics' parameters. Finally, a comprehensive computational experiment is described, performed on a set of instances and the results are analyzed and discussed.

[1]  Rainer Kolisch,et al.  Integrated scheduling, assembly area- and part-assignment for large-scale, make-to-order assemblies , 2000 .

[2]  Shahram Shadrokh,et al.  An Algorithm for the Weighted Earliness-Tardiness Unconstrained Project Scheduling Problem , 2008 .

[3]  Francis Sourd,et al.  An improved earliness-tardiness timing algorithm , 2007, Comput. Oper. Res..

[4]  J. Patterson,et al.  Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach , 1977 .

[5]  Qi Hao,et al.  Earliness/tardiness producution planning by JIT philosophy for job-lot manufacturing systems , 1998 .

[6]  Grzegorz Waligóra,et al.  Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models , 2005, Eur. J. Oper. Res..

[7]  A. H. Russell.  Cash Flows in Networks , 1970 .

[8]  Salah E. Elmaghraby,et al.  The scheduling of activities to maximize the net present value of projects , 1990 .

[9]  Seyed Taghi Akhavan Niaki,et al.  A genetic algorithm for resource investment problem with discounted cash flows , 2006, Appl. Math. Comput..

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

[11]  R. Tiwari,et al.  Fuzzy goal programming- an additive model , 1987 .

[12]  Seyed Taghi Akhavan Niaki,et al.  An efficient genetic algorithm to maximize net present value of project payments under inflation and bonus-penalty policy in resource investment problem , 2010, Adv. Eng. Softw..

[13]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines. A stochastic approach to combinatorial optimization , 1989 .

[14]  Jarek Nabrzyski,et al.  Grid resource management: state of the art and future trends , 2004 .

[15]  A. Shtub,et al.  Scheduling projects to maximize net present value — the case of time-dependent, contingent cash flows , 1997 .

[16]  Rainer Kolisch.  Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation , 1994 .

[17]  Norbert Trautmann,et al.  An iterated-local-search heuristic for the resource-constrained weighted earliness-tardiness project scheduling problem , 2008 .

[18]  Douglas C. Montgomery,et al.  Response Surface Methodology: Process and Product Optimization Using Designed Experiments , 1995 .

[19]  Seyed Taghi Akhavan Niaki,et al.  Statistical Design of Genetic Algorithms for Combinatorial Optimization Problems , 2011 .

[20]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[21]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[22]  S. T. A. Niaki,et al.  A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations , 2009, Comput. Oper. Res..

[23]  Shahram Shadrokh,et al.  A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty , 2007, Eur. J. Oper. Res..

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

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

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

[27]  Francis Sourd,et al.  A new model for the preemptive earliness-tardiness scheduling problem , 2009, Comput. Oper. Res..

[28]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.

[29]  Richard C. Grinold,et al.  The payment scheduling problem , 1972 .

[30]  Grzegorz Waligóra,et al.  Discrete-continuous project scheduling with discounted cash flows - A tabu search approach , 2008, Comput. Oper. Res..

[31]  R. Etgar,et al.  Scheduling project activities to maximize the net present value the case of linear time-dependent cash flows , 1999 .

[32]  Robert A. Russell,et al.  A comparison of heuristics for scheduling projects with cash flows and resource restrictions , 1986 .