Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

Genetic Algorithm for a Discrete-Continuous Project Scheduling Problem with Discounted Cash Flows

Authors

[ 1 ] Instytut Informatyki, Wydział Informatyki, Politechnika Poznańska | [ P ] employee

Year of publication

2015

Chapter type

paper

Publication language

english

Keywords
EN
  • Project scheduling
  • discrete-continuous
  • cash flow
  • net present value
  • genetic algorithm
Abstract

EN In this paper a discrete-continuous project scheduling problem with discounted cash flows is considered. In discrete-continuous project scheduling activities require for their processing discrete and continuous resources. Processing rate of an activity is the same function of the amount of the continuous resource allotted to this activity at a time. A positive cash flow is associated with each activity. A common payment model - payments at activity completion times is considered. The objective is the maximization of the net present value of all cash flows of the project. An application of genetic algorithm is described, and the algorithm is computationally tested. Some conclusions as well as directions for future research are given.

Pages (from - to)

52 - 57

DOI

10.1109/MMAR.2015.7283705

URL

https://ieeexplore.ieee.org/document/7283705

Book

20th International Conference on Methods and Models in Automation and Robotics (MMAR), Miedzyzdroje, 24-27 August, 2015

Presented on

20th International Conference on Methods and Models in Automation and Robotics, MMAR 2015, 24-27.08.2015, Miedzyzdroje, Poland

Publication indexed in

WoS (15)

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.