• Login
    View Item 
    •   Vlerick Repository Home
    • Research Output
    • Research Communication
    • View Item
    •   Vlerick Repository Home
    • Research Output
    • Research Communication
    • 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

    New computational results for the discrete time/cost trade-off problem with time-switch constraints

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Vanhoucke_M_WP_NewComputationa ...
    Size:
    134.5Kb
    Format:
    PDF
    Download
    Publication type
    Working paper
    Author
    Vanhoucke, Mario
    Publication Year
    2002
    Publication Issue
    18
    Publication Number of pages
    30
    
    Metadata
    Show full item record
    Abstract
    Recently, time-switch constraints have been introduced in literature by Yang and Chen (2000). Basically, these constraints impose a specified starting time on the project activities and force them to be inactive during specified time periods. This type of constraints have been incorporated into the well-known discrete time/cost trade-off problem in order to cope with day, night and weekend shifts. In this paper, we propose a new branch-and-bound algorithm which outperforms the previous one by Vanhoucke et al. (2002a). The procedure makes use of a lower bound calculation for the discrete time/cost trade-off problem (without time-switch constraints). The procedure has been coded in Visual C++, version 6.0 under Windows 2000 and has been validated on a randomly generated problem set. Keywords: Project Management, CPM, Time/cost trade-off problem, Time-switch constraints.
    Keyword
    Programme & Portfolio Management
    Knowledge Domain/Industry
    Operations & Supply Chain Management
    URI
    http://hdl.handle.net/20.500.12127/808
    Other links
    http://public.vlerick.com/Publications/8078d569-69a9-e011-8a89-005056a635ed.pdf
    Collections
    Research Communication

    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.