Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 32722
Finding Pareto Optimal Front for the Multi- Mode Time, Cost Quality Trade-off in Project Scheduling

Authors: H. Iranmanesh, M. R. Skandari, M. Allahverdiloo


Project managers are the ultimate responsible for the overall characteristics of a project, i.e. they should deliver the project on time with minimum cost and with maximum quality. It is vital for any manager to decide a trade-off between these conflicting objectives and they will be benefited of any scientific decision support tool. Our work will try to determine optimal solutions (rather than a single optimal solution) from which the project manager will select his desirable choice to run the project. In this paper, the problem in project scheduling notated as (1,T|cpm,disc,mu|curve:quality,time,cost) will be studied. The problem is multi-objective and the purpose is finding the Pareto optimal front of time, cost and quality of a project (curve:quality,time,cost), whose activities belong to a start to finish activity relationship network (cpm) and they can be done in different possible modes (mu) which are non-continuous or discrete (disc), and each mode has a different cost, time and quality . The project is constrained to a non-renewable resource i.e. money (1,T). Because the problem is NP-Hard, to solve the problem, a meta-heuristic is developed based on a version of genetic algorithm specially adapted to solve multi-objective problems namely FastPGA. A sample project with 30 activities is generated and then solved by the proposed method.

Keywords: FastPGA, Multi-Execution Activity Mode, Pareto Optimality, Project Scheduling, Time-Cost-Quality Trade-Off.

Digital Object Identifier (DOI):

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1751


[1] Project Management Institute, "A guide to the project management body of knowledge", Third Edition, PMI Publisher, 2004, pp. 110-117
[2] Babu, A.J.G., and Nalina Suresh. "Project management with time, cost, and quality considerations." Journal of Operational Research 88, 1996: 320-327.
[3] Kelly, J. "Critical-path planning and scheduling: Mathematical basis." (Operations Research) 9, no. 3 (1961): 296-320.
[4] Fulkerson, D.R. "A network flow computation for project cost curves." (Management Science) 7, no. 2 (1961): 167-181.
[5] Demeulemeester, Erik l., and Willy S. Herroelen. "Project Scheduling: A research handbook". Kluwer Academy Publishers inc., 2002.
[6] Demeulemeester, E., S. E Elmaghraby, and W. Herroelen. "Optimal procedures for the discrete time/cost trade-off problem in project networks." Vol. 88. European Journal of Operational Research, 1996
[7] De, P., E. J. Dunne, J. B. Ghosh, and C. E. Wells. "Complexity of the discrete time/cost trade-off problem for project networks." (Operations Research) 45 (1997): 302-306.
[8] Tareghian, Hamed R., and Seyyed Hassan Taheri. "On the discrete time, cost and quality trade-off problem."Applied Mathematics and Computation 181 (2006): 1305-1312.
[9] Tareghian, Hamed R., and Seyyed Hassan Taheri. "A solution procedure for the discrete time,cost and quality tradeoff problem using electromagnetic scatter." Applied Mathematics and Computation 190 (2007): 1136-1145.
[10] Herroelen, W., E. Demeulemeester, and B. De Reyck. "A classification scheme for project scheduling problems." J. Weglarz (Ed.), Handbook on recent advances in project scheduling, 1999.