A new multi-objective multi-mode model for solving preemptive time-cost-quality trade-off project scheduling problems

Authors:
Madjid Tavana;Amir-Reza Abtahi;Kaveh Khalili-Damghani
Affiliations:
Business Systems and Analytics Department, Lindback Distinguished Chair of Information Systems and Decision Sciences, La Salle University, Philadelphia, PA 19141, USA and Business Information Syst ...;Department of Knowledge Engineering and Decision Sciences, University of Economic Sciences, Tehran, Iran;Department of Industrial Engineering, South-Tehran Branch, Islamic Azad University, Tehran, Iran
Venue:
Expert Systems with Applications: An International Journal
Year:
2014

Citing 13
Cited 0

Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem

Mathematics of Operations Research
RanGen: A Random Network Generator for Activity-on-the-Node Networks

Journal of Scheduling
Solving Project Scheduling Problems by Minimum Cut Computations

Management Science
The discrete time/cost trade-off problem: extensions and heuristic procedures

Journal of Scheduling
Scheduling projects with limited number of preemptions

Computers and Operations Research
Using novel particle swarm optimization scheme to solve resource-constrained scheduling problem in PSPLIB

Expert Systems with Applications: An International Journal
Particle swarm optimization with justification and designed mechanisms for resource-constrained project scheduling problem

Expert Systems with Applications: An International Journal
Extraction of decision alternatives in construction management projects: Application and adaptation of NSGA-II and MOPSO

Expert Systems with Applications: An International Journal
An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs

Computers and Operations Research
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation
A hybrid genetic algorithm for the discrete time-cost trade-off problem

Expert Systems with Applications: An International Journal
Project scheduling with flexible resources: formulation and inequalities

OR Spectrum
Introduction to Evolutionary Algorithms

Introduction to Evolutionary Algorithms

Quantified Score

Hi-index	12.05

Visualization

Abstract

Considering the trade-offs between conflicting objectives in project scheduling problems (PSPs) is a difficult task. We propose a new multi-objective multi-mode model for solving discrete time-cost-quality trade-off problems (DTCQTPs) with preemption and generalized precedence relations. The proposed model has three unique features: (1) preemption of activities (with some restrictions as a minimum time before the first interruption, a maximum number of interruptions for each activity, and a maximum time between interruption and restarting); (2) simultaneous optimization of conflicting objectives (i.e., time, cost, and quality); and (3) generalized precedence relations between activities. These assumptions are often consistent with real-life projects. A customized, dynamic, and self-adaptive version of a multi-objective evolutionary algorithm is proposed to solve the scheduling problem. The proposed multi-objective evolutionary algorithm is compared with an efficient multi-objective mathematical programming technique known as the efficient @e-constraint method. The comparison is based on a number of performance metrics commonly used in multi-objective optimization. The results show the relative dominance of the proposed multi-objective evolutionary algorithm over the @e-constraint method.