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

Online And Semi-Online Scheduling On Capacitated Two-Parallel Machines

Author

Listed:
  • AN ZHANG

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

  • YIWEI JIANG

    (Key Laboratory of Advanced Textile Materials and Manufacturing Technology, Zhejiang Sci-Tech University, Hangzhou 310018, P. R. China)

  • ZHIYI TAN

    (Department of Mathematics, State Key Lab of CAD & CG, Zhejiang University, Hangzhou 310027, P. R. China)

Abstract

In this paper, we investigate the capacitated two-parallel machines scheduling problem, where one machine is only available for a special period of time after which it can no longer process any job while the other machine is continuously available. Our objective is to minimize the completion time of the machine which is continuously available. The offline version of the problem is equivalent to the minimization version of the Subset-Sum problem. We first show the lower bound of the online version is infinite. We also consider the semi-online version with known the total job processing time in advance, for which both lower bound and semi-online algorithms are given.

Suggested Citation

  • An Zhang & Yiwei Jiang & Zhiyi Tan, 2011. "Online And Semi-Online Scheduling On Capacitated Two-Parallel Machines," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 28(02), pages 163-182.
    • Handle: RePEc:wsi:apjorx:v:28:y:2011:i:02:n:s0217595911003119
    DOI: 10.1142/S0217595911003119
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595911003119
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595911003119?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:28:y:2011:i:02:n:s0217595911003119. 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.