Advanced Search
MyIDEAS: Login

Solving the selective multi-category parallel-servicing problem

Contents:

Author Info

  • Range, Troels Martin

    ()
    (Department of Business and Economics)

  • Lusby, Richard Martin

    ()
    (Department of Engineering Management)

  • Larsen, Jesper

    ()
    (Department of Engineering Management)

Registered author(s):

    Abstract

    In this paper we present a new scheduling problem and describe a shortest path based heuristic as well as a dynamic programming based exact optimization algorithm to solve it. The Selective Multi-Category Parallel-Servicing Problem (SMCPSP) arises when a set of jobs has to be scheduled on a server (machine) with limited capacity. Each job requests service in a prespecified time window and belongs to a certain category. Jobs may be serviced partially, incurring a penalty; however, only jobs of the same category can be processed simultaneously. One must identify the best subset of jobs to process in each time interval of a given planning horizon while respecting the server capacity and scheduling requirements. We compare the proposed solution methods with a MILP formulation and show that the dynamic programming approach is faster when the number of categories is large, whereas the MILP can be solved faster when the number of categories is small.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://static.sdu.dk/mediafiles//2/9/D/%7B29DB134F-40DA-4AE9-B185-AAC00CD06F06%7Ddpbe5_2013.pdf
    Download Restriction: no

    Bibliographic Info

    Paper provided by Department of Business and Economics, University of Southern Denmark in its series Discussion Papers of Business and Economics with number 5/2013.

    as in new window
    Length: 26 pages
    Date of creation: 05 Mar 2013
    Date of revision:
    Handle: RePEc:hhs:sdueko:2013_005

    Contact details of provider:
    Postal: Department of Business and Economics, University of Southern Denmark, Campusvej 55, DK-5230 Odense M, Denmark
    Phone: 65 50 32 33
    Fax: 65 50 32 37
    Email:
    Web page: http://www.sdu.dk/ivoe
    More information through EDIRC

    Related research

    Keywords: Machine scheduling; dynamic programming; node-disjoint shortest-path problem; preprocessing;

    Find related papers by JEL classification:

    This paper has been announced in the following NEP Reports:

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. S. Illeris & G. Akehurst, 2001. "Introduction," The Service Industries Journal, Taylor & Francis Journals, vol. 21(1), pages 1-4, January.
    2. Range, Troels Martin & Lusby, Richard Martin & Larsen, Jesper, 2013. "A column generation approach for solving the patient admission scheduling problem," Discussion Papers of Business and Economics 1/2013, Department of Business and Economics, University of Southern Denmark.
    Full references (including those not matched with items on IDEAS)

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:hhs:sdueko:2013_005. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Lene Holbæk).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.