{"title":"Metaheuristics for some discrete-continuous project scheduling problems to maximize the net present value","authors":"Grzegorz Waligóra","doi":"10.1109/MMAR.2017.8046873","DOIUrl":null,"url":null,"abstract":"In this paper a discrete-continuous project scheduling problem with discounted cash flows is considered. Each activity of the project requires for its processing discrete resources and an amount of a continuous, renewable resource. Processing rate of an activity is an increasing function of the amount of the continuous resource allotted to this activity at a time. A positive cash flow is associated with the completion of each activity. The objective is the maximization of the net present value (NPV). A heuristic procedure for allocating the continuous resource is presented. Three local search metaheuristics: simulated annealing (SA), tabu search (TS), and genetic algorithm (GA) are proposed for the defined problem, and compared a basis of a computational experiment. Some conclusions and directions for future research are given.","PeriodicalId":189753,"journal":{"name":"2017 22nd International Conference on Methods and Models in Automation and Robotics (MMAR)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 22nd International Conference on Methods and Models in Automation and Robotics (MMAR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMAR.2017.8046873","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper a discrete-continuous project scheduling problem with discounted cash flows is considered. Each activity of the project requires for its processing discrete resources and an amount of a continuous, renewable resource. Processing rate of an activity is an increasing function of the amount of the continuous resource allotted to this activity at a time. A positive cash flow is associated with the completion of each activity. The objective is the maximization of the net present value (NPV). A heuristic procedure for allocating the continuous resource is presented. Three local search metaheuristics: simulated annealing (SA), tabu search (TS), and genetic algorithm (GA) are proposed for the defined problem, and compared a basis of a computational experiment. Some conclusions and directions for future research are given.