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

On-line scheduling with equal-length jobs on parallel-batch machines to minimise maximum flow-time with delivery times

Author

Listed:
  • Ran Lin
  • Wenhua Li
  • Xing Chai

Abstract

We consider on-line scheduling on m parallel-batch machines with equal-length jobs. The jobs arrive over time and the goal is to minimise the maximum flow-time with delivery times. When the capacity of each batch is unbounded, we provide a best possible on-line algorithm of competitive ratio 1+αm, where αm is the positive root of x2+mx=1. When the capacity of each batch is bounded, we provide a best possible on-line algorithm of competitive ratio 5+12. For the non-batch model, i.e., the capacity of each batch is 1, we provide a best possible on-line algorithm of competitive ratio 2 for m = 1 and an on-line algorithm of competitive ratio 32 for m≥2.

Suggested Citation

  • Ran Lin & Wenhua Li & Xing Chai, 2021. "On-line scheduling with equal-length jobs on parallel-batch machines to minimise maximum flow-time with delivery times," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(8), pages 1754-1761, August.
    • Handle: RePEc:taf:tjorxx:v:72:y:2021:i:8:p:1754-1761
    DOI: 10.1080/01605682.2019.1578626
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2019.1578626
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2019.1578626?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. Lin, Ran & Wang, Jun-Qiang & Liu, Zhixin & Xu, Jun, 2023. "Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions," European Journal of Operational Research, Elsevier, vol. 309(1), pages 53-64.
    3. Xia Qian & Zhang Xingong, 2023. "Online scheduling of two-machine flowshop with lookahead and incompatible job families," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-11, January.

    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:8:p:1754-1761. 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.