• Login
    View Item 
    •   Vlerick Repository Home
    • Research Output
    • Articles
    • View Item
    •   Vlerick Repository Home
    • Research Output
    • Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of Vlerick RepositoryCommunities & CollectionsPublication DateAuthorsTitlesSubjectsKnowledge Domain/IndustryThis CollectionPublication DateAuthorsTitlesSubjectsKnowledge Domain/Industry

    My Account

    LoginRegister

    Contact & Info

    ContactVlerick Journal ListOpen AccessVlerick Business School

    Statistics

    Display statistics

    Payment models and net present value optimization for resourceconstrained project scheduling

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Publisher version
    View Source
    Access full-text PDFOpen Access
    View Source
    Check access options
    Check access options
    Publication type
    Journal article with impact factor
    Author
    Leyman, Pieter
    Vanhoucke, Mario
    Publication Year
    2016
    Journal
    Computers and Industrial Engineering
    Publication Volume
    91
    Publication Issue
    January
    Publication Begin page
    139
    Publication End page
    153
    
    Metadata
    Show full item record
    Abstract
    This manuscript focuses on the single- and multi-mode resource-constrained project scheduling problem with discounted cash flows (RCPSPDC and MRCPSPDC) and three payment models. The contribution of the paper is twofold. First, we extend a new scheduling technique, which moves activities in order to improve the project net present value. This more general version is applicable to multiple problem formulations and provides an overarching framework in which these models can be implemented. The changes in activity finish times take other activities and the possible changes in the finish times of these other activities into account, by forming a set of activities which is subsequently moved in time. The scheduling technique is implemented within a genetic algorithm metaheuristic and employs two penalty functions, one for deadline feasibility and one for non-renewable resource feasibility. Second, we test the proposed approach on several datasets from literature and illustrate the added value of each part of the algorithm. The influence of data parameters on the project net present value is highlighted. The detailed results provided in this paper can be used as future benchmarks for each of the six models discussed.
    Keyword
    Net Present Value, Payment Models, Resource-constrained Project Scheduling, Metaheuristics
    Knowledge Domain/Industry
    Operations & Supply Chain Management
    DOI
    10.1016/j.cie.2015.11.008
    URI
    http://hdl.handle.net/20.500.12127/5494
    ae974a485f413a2113503eed53cd6c53
    10.1016/j.cie.2015.11.008
    Scopus Count
    Collections
    Articles

    entitlement

     
    DSpace software (copyright © 2002 - 2022)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.