Name
Title | ||
|---|---|---|
Resource constrained project scheduling problem with discounted earliness-tardiness penalties: Mathematical modeling and solving procedure |
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.cie.2013.06.017 | Computers & Industrial Engineering |
Keywords | Field | DocType |
mathematical modeling,earliness-tardiness penalty cost,comprehensive computational experiment,simulated annealing,resource-constrained project scheduling problem,present value,genetic algorithm,due date,np-hard problem,discounted earliness-tardiness penalty,response surface methodology,project scheduling,net present value | Simulated annealing,Mathematical optimization,Schedule (project management),Tardiness,Computer science,Nurse scheduling problem,Genetic algorithm scheduling,Dynamic priority scheduling,Net present value,Operations management,Genetic algorithm | Journal |
Volume | Issue | ISSN |
66 | 2 | 0360-8352 |
Citations | PageRank | References |
8 | 0.48 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yazdan Khoshjahan | 1 | 8 | 0.48 |
| Amir Abbas Najafi | 2 | 153 | 13.32 |
| Behrouz Afshar-Nadjafi | 3 | 36 | 5.51 |