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

A Best Possible Online Algorithm For Scheduling To Minimize Maximum Flow-Time On Bounded Batch Machines

Author

Listed:
  • CHENGWEN JIAO

    (School of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450001, People's Republic of China;
    School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100049, People's Republic of China)

  • WENHUA LI

    (School of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450001, People's Republic of China)

  • JINJIANG YUAN

    (School of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450001, People's Republic of China)

Abstract

We consider online scheduling of unit length jobs on m identical parallel-batch machines. Jobs arrive over time. The objective is to minimize maximum flow-time, with the flow-time of a job being the difference of its completion time and its release time. A parallel-batch machine can handle up to b jobs simultaneously as a batch. Here, the batch capacity is bounded, that is b

Suggested Citation

  • Chengwen Jiao & Wenhua Li & Jinjiang Yuan, 2014. "A Best Possible Online Algorithm For Scheduling To Minimize Maximum Flow-Time On Bounded Batch Machines," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 31(04), pages 1-10.
    • Handle: RePEc:wsi:apjorx:v:31:y:2014:i:04:n:s0217595914500304
    DOI: 10.1142/S0217595914500304
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lin, Ran & Wang, Jun-Qiang & Oulamara, Ammar, 2023. "Online scheduling on parallel-batch machines with periodic availability constraints and job delivery," Omega, Elsevier, vol. 116(C).
    2. Xing Chai & Wenhua Li & Yuejuan Zhu, 2021. "Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine," Annals of Operations Research, Springer, vol. 298(1), pages 79-93, March.
    3. Christoph Hertrich & Christian Weiß & Heiner Ackermann & Sandy Heydrich & Sven O. Krumke, 2022. "Online algorithms to schedule a proportionate flexible flow shop of batching machines," Journal of Scheduling, Springer, vol. 25(6), pages 643-657, December.

    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:31:y:2014:i:04:n:s0217595914500304. 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.