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

    A new algorithm for resource-constrained project scheduling with breadth and depth of skills

    • 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
    Snauwaert, Jakob
    Vanhouke, Mario
    Publication Year
    2021
    Journal
    European Journal of Operational Research
    Publication Volume
    292
    Publication Issue
    1
    Publication Begin page
    43
    Publication End page
    59
    
    Metadata
    Show full item record
    Abstract
    This paper addresses a multi-skilled extension of the resource-constrained project scheduling problem (RCPSP). Although a handful of papers dealt with the multi-skilled RCPSP (MSRCPSP), little to no attention is given to the ideal levels of skills for multi-skilled resources. In this paper, skills are measured along two dimensions known as breadth and depth. In a project environment, the breadth of a resource is perceived as the amount of skills an employee masters. The depth of a skill is the efficiency level at which work can be performed by a resource that masters that skill. The MSRCPSP with breadth and depth consists of scheduling activities with skill requirements and assigning multi-skilled resources to those activities. To be able to efficiently solve the MSRCPSP, a genetic algorithm is developed. Using the created activity schedules and resources assignments, the best workforce characteristics are analysed. Key aspects in this analysis are the breadth and depth. The problem-specific procedure combines a new representation, a new crossover and tailor-made local searches. Computational experiments measure the impact of different multi-skilled resources and their efficiency levels on the makespan of the project.
    Keyword
    Project Scheduling, Resource-constrained Scheduling, Multi-skilled Resources, Genetic Algorithm
    Knowledge Domain/Industry
    Operations & Supply Chain Management
    DOI
    10.1016/j.ejor.2020.10.032
    URI
    http://hdl.handle.net/20.500.12127/6652
    ae974a485f413a2113503eed53cd6c53
    10.1016/j.ejor.2020.10.032
    Scopus Count
    Collections
    Articles

    entitlement

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