Resource constrained project scheduling problem with discounted earliness-tardiness penalties: Mathematical modeling and solving procedure

Authors:
Yazdan Khoshjahan;Amir Abbas Najafi;Behrouz Afshar-Nadjafi
Affiliations:
Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran;Faculty of Industrial Engineering, K.N. Toosi University of Technology, Tehran, Iran;Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
Venue:
Computers and Industrial Engineering
Year:
2013

Citing 9
Cited 0

A comparison of heuristics for scheduling projects with cash flows and resource restrictions

Management Science
Fuzzy goal programming- an additive model

Fuzzy Sets and Systems
Characterization and generation of a general class of resource-constrained project scheduling problems

Management Science
Response Surface Methodology: Process and Product in Optimization Using Designed Experiments

Response Surface Methodology: Process and Product in Optimization Using Designed Experiments
An improved earliness-tardiness timing algorithm

Computers and Operations Research
Discrete-continuous project scheduling with discounted cash flows-A tabu search approach

Computers and Operations Research
A new model for the preemptive earliness-tardiness scheduling problem

Computers and Operations Research
A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations

Computers and Operations Research
An efficient genetic algorithm to maximize net present value of project payments under inflation and bonus-penalty policy in resource investment problem

Advances in Engineering Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the resource-constrained project scheduling problem with a due date for each activity. The objective is to minimize the net present value of the earliness-tardiness penalty costs. The problem is first mathematically modeled. Then, two meta-heuristics, genetic algorithm and simulated annealing are proposed to solve this strongly NP-hard problem. Design of experiments and response surface methodology are employed to fine-tune the meta-heuristics' parameters. Finally, a comprehensive computational experiment is described, performed on a set of instances and the results are analyzed and discussed.