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

Metaheuristics for some discrete-continuous project scheduling problems to maximize the net present value

Authors

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

Scientific discipline (Law 2.0)

[2.3] Information and communication technology

Year of publication

2017

Chapter type

chapter in monograph / paper

Publication language

english

Keywords
EN
  • project scheduling
  • discrete-continuous
  • cash flow
  • net present value
  • simulated annealing
  • tabu search
Pages (from - to)

471 - 476

DOI

10.1109/MMAR.2017.8046873

Book

22nd International Conference on Methods and Models in Automation and Robotics MMAR 2017, Miedzyzdroje, Poland, August 28-31, 2017

Presented on

22nd International Conference on Methods and Models in Automation and Robotics MMAR 2017, 28-31.08.2017, Międzyzdroje, Polska

Ministry points / chapter

20

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.