IDEAS home Printed from https://ideas.repec.org/p/hhs/sdueko/2013_005.html
   My bibliography  Save this paper

Solving the selective multi-category parallel-servicing problem

Author

Listed:
  • Range, Troels Martin

    () (Department of Business and Economics)

  • Lusby, Richard Martin

    () (Department of Engineering Management)

  • Larsen, Jesper

    () (Department of Engineering Management)

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.

Suggested Citation

  • Range, Troels Martin & Lusby, Richard Martin & Larsen, Jesper, 2013. "Solving the selective multi-category parallel-servicing problem," Discussion Papers of Business and Economics 5/2013, University of Southern Denmark, Department of Business and Economics.
  • Handle: RePEc:hhs:sdueko:2013_005
    as

    Download full text from publisher

    File URL: http://static.sdu.dk/mediafiles//2/9/D/%7B29DB134F-40DA-4AE9-B185-AAC00CD06F06%7Ddpbe5_2013.pdf
    Download Restriction: no

    References listed on IDEAS

    as
    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, University of Southern Denmark, Department of Business and Economics.
    Full references (including those not matched with items on IDEAS)

    More about this item

    Keywords

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

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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). General contact details of provider: http://edirc.repec.org/data/okioudk.html .

    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 CitEc recognized a reference but did not link an item in RePEc 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.