TY - JFULL AU - H. Iranmanesh and M. R. Skandari and M. Allahverdiloo PY - 2008/3/ TI - Finding Pareto Optimal Front for the Multi-Mode Time, Cost Quality Trade-off in Project Scheduling T2 - International Journal of Economics and Management Engineering SP - 109 EP - 114 VL - 2 SN - 1307-6892 UR - https://publications.waset.org/pdf/6911 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 14, 2008 N2 - 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. ER -