IJE TRANSACTIONS A: Basics Vol. 21, No. 4 (November 2008) 347-360   

downloaded Downloaded: 146   viewed Viewed: 1947

M. Seifi and R. Tavakkoli-Moghaddam*

Department of Industrial Engineering, College of Engineering, University of Tehran
P.O. Box 11155/4563, Tehran, Iran
massoud_seify@yahoo.com - tavakoli@ut.ac.ir

* Corresponding Author
( Received: January 06, 2008 – Accepted in Revised Form: May 09, 2008 )

Abstract    The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategies. In this paper, we present a new bi-objective model for the MRCPSP that maximizes the net present value (NPV) and minimizes the holding cost of activities completed by the projects’ completion time. For better adoption with real conditions, we consider four different payment models for positive cash flow. To verify the proposed model, a number of numerical examples are solved in small sizes and the related computational results are illustrated in terms of schedules. Finally, a meta-heuristic algorithm based on simulated annealing (SA) is utilized to solve our four payment proposed models in various sizes and the obtained results were analyzed.


Keywords    Project Scheduling, Net Present Value, Resource Constraint, Execution Mode, Payment Model



1. Kolisch, R. and Padman, R., “An Integrated Survey of Deterministic Project Scheduling”, Omega, Vol. 29, (2001), 249-272.

2. Sprecher, A., Kolisch, R. and Drexl, “A., Semi-Active, Active, and Non-Delay Schedules for the Resource-Constrained Project Scheduling Problem”, European Journal of Operational Research, Vol. 80, (1995), 94-102.

3. Herroelen, W., Demeulemeester, E. and De Reyck, B., “A Classification Scheme for Project Scheduling, In, J. Weglarz (Ed.), Project Scheduling-Recent Models, Algorithms and Applications”, Boston: Kluwer Academic, (1999), 1-26.

4. Russell, A. H., “Cash Flows in Networks”, Management Science, Vol. 16, No. 5 (1970), 357-373

5. Ulusoy, G., Serifoglo, F. S. and Sahin S., “Four Payment Models for the Multi-Mode Resource Constrained Project Scheduling Problem with Discounted Cash Flows”, Annals of Operations Research, Vol. 102, (2001), 237-261

6. Mika, M., Waligora, G. and Wezglarz, J., “Simulated Annealing and Tabu Search for Multi-Mode Resource-Constrained Project Scheduling with Positive Discounted Cash Flows and Different Payment Models”, European Journal of Operational Research, Vol. 164, (2005), 639-668.
7. Herroelen, W., Reyck, B. D. and Demeulemeester, E., “Resource-Constrained Project Scheduling: A Survey of Recent Developments”, Computers and Operations Research, Vol. 25, No. 4, (1998), 279-302.

8. Brinkmann, K. and Neumann, K., “Heuristic Procedures for Resource-Constrained Project Scheduling with Minimal and Maximal Time Lags: The Resource Leveling and the Minimum Project-Duration Problem”, Journal of Decision Systems, Vol. 5, (1996) 129-55.

9. Bandelloni, M., Tucci, M. and Rinaldi, R., “Optimal Resource Leveling Using Non-Serial Dynamic Programming”, European Journal of Operational Research, Vol. 78, (1994), 162-177.

10. Najafi, A.A. and Niaki, S. T. A., “A genetic Algorithm for Resource Investment Problem with Discounted Cash Flows”, Applied Mathematics and Computation, Vol. 183, No. 2, (2006), 1057-1070.

11. Najafi, A. A. and Niaki, S. T. A., “Resource Investment Problem with Discounted Cash Flows”, International Journal of Engineering, Vol. 18, No. 1, (2005), 53-64.

12. Shadrokh, S. and Kianfar, F., “A Genetic Algorithm for Resource Investment Project Scheduling Problem, Tardiness Permitted with Penalty”, European Journal of Operational Research, Vol. 181, No. 1, (2007), 86-101.

13. Icmeli, O. and Rom, W. O., “Ensuring Quality in Resource Constrained Project Scheduling”, European Journal of Operational Research, Vol. 103, (1997), 483-96.

14. Erengüc, S. S. and Icmeli, O., “Integrating Quality as a Measure of Performance in Resource-Constrained Project Scheduling Problems”, In J. Weglarz (Ed.), Project Scheduling Recent Models, Algorithms and Applications, Boston: Kluwer Academic, U.S.A., (1999) 433-50.

15. Al-Fawzan, M. A. and Haouari, M., “A Bi-Objective Model for Robust Resource-Constrained Project Scheduling”, International Journal of Production Economics, Vol. 96, (2005), 175-187.

16. Kobylańki, P. and Kuchta, D., “A Note on the Paper by Al-Fawzan, M. A. and Haouari, M. About A Bi-Objective Problem for Robust Resource-Constrained Project Scheduling”, International Journal of Production Economics, Vol. 107, (2007), 496-501.

17. Zhenyuan, L. and Hongwei, W., “Heuristic algorithm for RCPSP with the Objectie of Minimizing Activities’ Cost”, Journal of Systems Engineering and Electronics, Vol. 17, No. 1, (2006), 96-102.

18. Kirkpatrick, S., Gelatt, C. D. and Vecchi, M. P., Optimization by Simulated Annealing, Science, Vol. 220, (1983), 671-680.

19. Klein, R., “Bidirectional Planning: Improving Priority Rule-Based Heuristics for Scheduling Resource Constrained Projects”, European Journal of Operational Research, Vol. 127, (2000), 619-638.

20. Kolisch, R., “Serial and Parallel Resource-Constrained Project Scheduling Methods Revisited-Theory and Computation”, European Journal of Operational Research, Vol. 90, (1996), 320-333.

21. Kolisch, R., Sprecher, A. and Drexl, A., “Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems”, ManagementScience, Vol. 41, (1995), 1693-1703.

International Journal of Engineering
E-mail: office@ije.ir
Web Site: http://www.ije.ir