IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v72y2021i10p2286-2289.html
   My bibliography  Save this article

Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences

Author

Listed:
  • T. C. E. Cheng
  • Svetlana A. Kravchenko
  • Bertrand M. T. Lin

Abstract

We study server scheduling on parallel dedicated machines to minimize the makespan subject to given processing sequences. Before a job starts its processing on its designated machine, a loading operation must be performed, which is undertaken by a server shared by all the jobs. While the two-machine problem is polynomially solvable, we show that the problem becomes binary NP-hard when the number of machines is three, and propose a pseudo-polynomial algorithm to solve the problem with a constant number of machines.

Suggested Citation

  • T. C. E. Cheng & Svetlana A. Kravchenko & Bertrand M. T. Lin, 2021. "Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(10), pages 2286-2289, October.
    • Handle: RePEc:taf:tjorxx:v:72:y:2021:i:10:p:2286-2289
    DOI: 10.1080/01605682.2020.1779625
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2020.1779625
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2020.1779625?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    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:taf:tjorxx:v:72:y:2021:i:10:p:2286-2289. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.