IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v24y2007i02ns0217595907001231.html
   My bibliography  Save this article

Online Algorithms For Scheduling With Machine Activation Cost

Author

Listed:
  • YONG HE

    (Department of Mathematics, Zhejiang University, Hangzhou 310027, P. R. China)

  • SHUGUANG HAN

    (Department of Mathematics, Zhejiang University, Hangzhou 310027, P. R. China)

  • YIWEI JIANG

    (Faculty of Science, Zhejiang Sci-Tech University, Hangzhou 310018, China)

Abstract

In this paper, we consider a variant of the classical parallel machine scheduling problem. For this problem, we are givenmpotential identical machines to non-preemptively process a sequence of independent jobs. Machines need to be activated before starting to process, and each machine activated incurs a fixed machine activation cost. No machines are initially activated, and when a job is revealed the algorithm has the option to activate new machines. The objective is to minimize the sum of the makespan and activation cost of machines. We first present two optimal online algorithms with competitive ratios of 3/2 and 5/3 form = 2, 3 cases, respectively. Then we present an online algorithm with a competitive ratio of at most 2 for generalm ≥ 4, while the lower bound is 1.88.

Suggested Citation

  • Yong He & Shuguang Han & Yiwei Jiang, 2007. "Online Algorithms For Scheduling With Machine Activation Cost," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 24(02), pages 263-277.
    • Handle: RePEc:wsi:apjorx:v:24:y:2007:i:02:n:s0217595907001231
    DOI: 10.1142/S0217595907001231
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595907001231
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595907001231?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.

    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:wsi:apjorx:v:24:y:2007:i:02:n:s0217595907001231. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.