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

Semi-online scheduling of two job types on a set of multipurpose machines

Author

Listed:
  • Shlomo Karhi

Abstract

In the majority of studies of online scheduling on m multipurpose machines, there is complete uncertainty about the scheduling instance. In contrast, we consider a semi-online environment where there is prior knowledge about some parameters of the problem and the objective is to minimise the makespan. In our problem, there are two job types, each of which can be processed on a unique subset of an arbitrary number of machines and the processing sets are of arbitrary structure. We analyse three distinct cases, corresponding to prior knowledge of the following three values: (1) the optimal (offline) solution value; (2) the value of the total processing time; (3) the (constant) value of the largest processing time or an upper bound on the largest processing time. We provide a semi-online algorithm with a competitive ratio of 2-$ - $1/m for the first two variations. For the last case, we show a competitive ratio as a function of the processing set parameters. In this case, we prove that the algorithm is asymptotically optimal for any structure of the multipurpose machines and that the competitive ratio in the worst case tends to 4/3.

Suggested Citation

  • Shlomo Karhi, 2018. "Semi-online scheduling of two job types on a set of multipurpose machines," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(9), pages 1445-1455, September.
    • Handle: RePEc:taf:tjorxx:v:69:y:2018:i:9:p:1445-1455
    DOI: 10.1080/01605682.2017.1404185
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2017.1404185
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2017.1404185?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:69:y:2018:i:9:p:1445-1455. 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.