• 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

    Scheduling of unrelated parallel machines with limited server availability on multiple production locations: a case study in knitted frabrics

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Publication type
    Vlerick strategic journal article
    Author
    Kerkhove, Louis-Philippe
    Vanhoucke, Mario
    Publication Year
    2014
    Journal
    International Journal of Production Research
    Publication Volume
    52
    Publication Issue
    9
    Publication Begin page
    2630
    Publication End page
    2653
    
    Metadata
    Show full item record
    Abstract
    This paper studies a complex variation of the parallel machine scheduling (PMS) problem, as encountered at a Belgian producer of knitted fabrics. The aim is to assign N J jobs to N M unrelated parallel machines, minimising a weighted combination of job lateness and tardiness. Jobs are assigned specific release, and due dates and changeover times are sequence dependent. Current literature is extended by including geographically dispersed production locations, which influence job due dates and objective function coefficients. Furthermore, the changeover interference due to limited availability of technicians is also studied in this paper. The scheduling problem is solved using a hybrid meta-heuristic, which combines elements from simulated annealing and genetic algorithms. This hybrid meta-heuristic is capable of solving real-scale scheduling problems of up to 750 jobs, 75 machines and 10 production locations within reasonable computation time. This hybrid scheduling procedure is extended with heuristic dispatching rules capable of reducing the impact of changeover interference by 23% on average compared to the random scenario, for the case where a single technician is expected to serve up to 12 machines.
    Keyword
    Hybrid Meta-heuristic, Geographically Dispersed Production Locations, Changeover Interference, Case Study, TIMES, Parallel Machine Scheduling
    Knowledge Domain/Industry
    Operations & Supply Chain Management
    DOI
    10.1080/00207543.2013.865855
    URI
    http://hdl.handle.net/20.500.12127/4967
    ae974a485f413a2113503eed53cd6c53
    10.1080/00207543.2013.865855
    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.