• 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 nurse scheduling problem: A scatter search algorithm

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Maenhout_B_WP_NewComputational ...
    Size:
    161.6Kb
    Format:
    PDF
    Download
    Publication type
    Working paper
    Author
    Maenhout, Broos
    Vanhoucke, Mario
    Publication Year
    2006
    Publication Issue
    6
    Publication Number of pages
    22
    
    Metadata
    Show full item record
    Abstract
    In this paper, we present a scatter search algorithm for the well-known nurse scheduling problem (NSP). This problem aims at the construction of roster schedules for nurses taking both hard and soft constraints into account. The objective is to minimize the total preference cost of the nurses and the total penalty cost from violations of the soft constraints. The problem is known to be NP-hard. The contribution of this paper is threefold. First, we are, to the best of our knowledge, the first to present a scatter search algorithm for the NSP. Second, we investigate two different types of solution combination methods in the scatter search framework, based on four different cost elements. Last, we present detailed computational experiments on a benchmark dataset presented recently, and solve these problem instances under different assumptions. We show that our procedure performs consistently well under many different circumstances, and hence, can be considered as robust against case-specific constraints. Keywords: meta-heuristics, scatter search, nurse scheduling
    Keyword
    Programme & Portfolio Management
    Knowledge Domain/Industry
    Operations & Supply Chain Management
    URI
    http://hdl.handle.net/20.500.12127/1958
    Other links
    http://public.vlerick.com/Publications/2f642c0d-6aa9-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.