• 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

    Capital- and resource-constrained project scheduling with net present value optimization

    • 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
    Vlerick strategic journal article
    Author
    Leyman, Pieter
    Vanhoucke, Mario
    Publication Year
    2017
    Journal
    European Journal of Operational Research
    Publication Volume
    256
    Publication Issue
    3
    Publication Begin page
    757
    Publication End page
    776
    
    Metadata
    Show full item record
    Abstract
    In this paper, we study the capital-constrained project scheduling problem with discounted cash flows (CCPSPDC) and the capital- and resource-constrained project scheduling problem with discounted cash flows (CRCPSPDC). The objective of both problems is to maximize the project net present value (NPV), based on three cash flow models. Both problems include capital constraints, which force the project to always have a positive cash balance. Hence, it is crucial to schedule activities in such an order that sufficient capital is available.The contribution of this paper is threefold. First, we propose three distinct cash flow models, which affect the capital availability during the project. Second, we introduce two new schedulers to improve capital feasibility, one for the CCPSPDC and one for the CRCPSPDC. The schedulers focus on delaying sets of activities, which cause cash outflows to be received at later time instances, in order to reduce capital shortages. Both schedulers are implemented as part of three metaheuristics from literature, in order to compare the metaheuristics' performance. Two penalty functions have been included, one to improve capital feasibility and another to improve deadline feasibility. Third, the proposed procedure has been tested on a large dataset and the added value of the schedulers has been validated. Managerial insights are provided with respect to the impact of key parameters.
    Keyword
    Net Present Value, Capital, Project Scheduling, Metaheuristics
    Knowledge Domain/Industry
    Operations & Supply Chain Management
    DOI
    10.1016/j.ejor.2016.07.019
    URI
    http://hdl.handle.net/20.500.12127/5708
    ae974a485f413a2113503eed53cd6c53
    10.1016/j.ejor.2016.07.019
    Scopus Count
    Collections
    Articles

    entitlement

     
    DSpace software (copyright © 2002 - 2023)  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.