A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search

Abstract Decisions concerning a project’s expedition, traditionally involved considerations regarding time and cost tradeoff. It was recently suggested that the quality of a project should also be taken into considerations. In this paper, we propose a meta-heuristic solution procedure for the discrete time, cost and quality tradeoff problem. This problem involves the scheduling of project activities in order to minimize the total cost of the project while maximizing the quality of the project and also meeting a given deadline. We apply a so called electromagnetic scatter search to solve this problem. In this process, we initially generate a population of feasible solutions. In so doing, we use frequency memory to well sample the feasible region. A number of these solutions are then selected and improved locally. The improved solutions are then combined to generate new set of solutions. The combination process utilizes attraction–repulsion mechanisms borrowed from the electromagnetism theory. The whole process is stopped when no significant improvement in the set of solutions are observed. The validity of the proposed solution procedure is demonstrated, and its applicability is tested on a randomly generated large and complex problem having 19,900 activities.

[1]  D. R. Robinson.  A Dynamic Programming Solution to Cost-Time Tradeoff for CPM , 1975 .

[2]  John E. Beasley,et al.  A genetic algorithm for the generalised assignment problem , 1997, Comput. Oper. Res..

[3]  Fred W. Glover,et al.  An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem , 2001, J. Glob. Optim..

[4]  Hassan Taheri,et al.  An application of randomized minimum cut to the project time/cost tradeoff problem , 2006, Appl. Math. Comput..

[5]  Hamed R. Tareghian,et al.  On the discrete time, cost and quality trade-off problem , 2006, Appl. Math. Comput..

[6]  Prabuddha De,et al.  The discrete time-cost tradeoff problem revisited , 1995 .

[7]  Fred W. Glover,et al.  A Template for Scatter Search and Path Relinking , 1997, Artificial Evolution.

[8]  Prabuddha De,et al.  Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks , 1997, Oper. Res..

[9]  Salah E. Elmaghraby,et al.  DAGEN: A Generator of Testsets for Project Activity Nets; Working Paper , 1994 .

[10]  S. K. Goyal.  Note---A Note on “A Simple CPM Time-Cost Tradeoff Algorithm” , 1975 .

[11]  Do Ba Khang,et al.  Time, cost and quality trade-off in project management: a case study , 1999 .

[12]  Erik Demeulemeester,et al.  Optimal procedures for the discrete time/cost trade-off problem in project networks , 1996 .

[13]  D. R. Fulkerson.  A Network Flow Computation for Project Cost Curves , 1961 .

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

[16]  Nalina Suresh,et al.  Project management with time, cost, and quality considerations , 1996 .

[17]  Shu-Cherng Fang,et al.  An Electromagnetism-like Mechanism for Global Optimization , 2003, J. Glob. Optim..

[18]  Joseph J. Moder,et al.  Project Management With Cpm, Pert and Precedence Diagramming , 1983 .

[19]  Erik Demeulemeester,et al.  RanGen: A Random Network Generator for Activity-on-the-Node Networks , 2003, J. Sched..

[20]  John F. Muth,et al.  A Dynamic Programming Algorithm for Decision CPM Networks , 1979, Oper. Res..

[21]  Bert De Reyck,et al.  A hybrid scatter search/electromagnetism meta-heuristic for project scheduling , 2006, Eur. J. Oper. Res..

[22]  Fred W. Glover,et al.  Principles of scatter search , 2006, Eur. J. Oper. Res..

[23]  Nicolai Siemens.  A Simple CPM Time-Cost Tradeoff Algorithm , 1971 .

[24]  K. Kapur.  An Algorithm for Project Cost-Duration Analysis Problem with Quadratic and Convex Cost Functions , 1973 .

[25]  Pedro Larrañaga,et al.  Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators , 1999, Artificial Intelligence Review.

[26]  J. Horowitz,et al.  Critical Path Problems with Concave Cost-Time Curves , 1972 .