• 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

    Resource-constrained multi-project scheduling: Benchmark datasets and decoupled scheduling

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Publication type
    Journal article with impact factor
    Author
    Van Eynde, Rob
    Vanhoucke, Mario
    Publication Year
    2020
    Journal
    Journal of Scheduling
    Publication Volume
    23
    Publication Begin page
    301
    Publication End page
    325
    
    Metadata
    Show full item record
    Abstract
    In this paper, we propose a new dataset for the resource-constrained multi-project scheduling problem and evaluate the performance of multi-project extensions of the single-project schedule generation schemes. This manuscript contributes to the existing research in three ways. First, we provide an overview of existing benchmark datasets and classify the multi-project literature based on the type of datasets that are used in these studies. Furthermore, we evaluate the existing summary measures that are used to classify instances and provide adaptations to the data generation procedure of Browning and Yassine (J Scheduling 13(2):143-161, 2010a). With this adapted generator we propose a new dataset that is complimentary to the existing ones. Second, we propose decoupled versions of the single-project scheduling schemes, building on insights from the existing literature. A computational experiment shows that the decoupled variants outperform the existing priority rule heuristics and that the best priority rules differ for the two objective functions under study. Furthermore, we analyse the effect of the different parameters on the performance of the heuristics. Third, we implement a genetic algorithm that incorporates specific multi-project operators and test it on all datasets. The experiment shows that the new datasets are challenging and provide opportunities for future research.
    Keyword
    Multi-project Scheduling, Portfolio Scheduling, Summary Measures, Decoupled Scheduling, Benchmark Data
    Knowledge Domain/Industry
    Operations & Supply Chain Management
    DOI
    10.1007/s10951-020-00651-w
    URI
    http://hdl.handle.net/20.500.12127/6591
    ae974a485f413a2113503eed53cd6c53
    10.1007/s10951-020-00651-w
    Scopus Count
    Collections
    Articles

    entitlement

     

    Related items

    Showing items related by title, author, creator and subject.

    • Thumbnail

      Project management using dynamic scheduling: baseline scheduling, risk analysis and project control

      Vanhoucke, Mario (The Measurable News, 2013)
    • Thumbnail

      Dynamic Scheduling: Integrating Schedule Risk Analysis with Earned Value Management

      Vanhoucke, Mario (The Measurable News, 2012)
      Financial statements vary between industries. Therefore, economic intuition suggests that industry effects should be an important component in bankruptcy prediction, however, in previous academic literature on default prediction, not much attention has been paid to these effects. In this study a number of questions concerning credit risk modelling of small and medium-sized enterprises (SMEs) and industry are answered.
    • Thumbnail

      A new scheduling technique for the resource-constrained project scheduling problem with discounted cash flows

      Leyman, Pieter; Vanhoucke, Mario (International Journal of Production Research, 2015)
      In this paper, we discuss the resource-constrained project scheduling problem with discounted cash flows. We introduce a new schedule construction technique which moves sets of activities to improve the project net present value and consists of two steps. In particular, the inclusion of individual activities into sets, which are then moved together, is crucial in both steps. The first step groups the activities based on the predecessors and successors in the project network, and adds these activities to a set based on their finish time and cash flow. The second step on the contrary does so based on the neighbouring activities in the schedule, which may but need not include precedence related activities. The proposed scheduling method is implemented in a genetic algorithm metaheuristic and we employ a penalty function to improve the algorithm's feasibility with respect to a tight deadline. All steps of the proposed solution methodology are tested in detail and an extensive computational experiment shows that our results are competitive with existing work.
    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.