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

Online Scheduling on a Bounded Batch Machine with Same-Length-Job Families

Author

Listed:
  • Libo Wang

    (School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan 450001, P. R. China)

  • Wenhua Li

    (School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan 450001, P. R. China)

  • Xing Chai

    (School of Mathematics and Statistics, Henan University of Technology, Zhengzhou, Henan 450001, P. R. China)

  • Yanhong Gao

    (School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan 450001, P. R. China)

  • Dan Yu

    (School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan 450001, P. R. China)

Abstract

We investigate an online scheduling problem on a bounded batch machine with f incompatible job families, in which the jobs are released over time and the jobs belonging to the same family have the same processing times. The goal is to minimize the maximum completion time. A machine can process at most b jobs simultaneously as a batch, where b is finite. A batch only contains the jobs from the same family. KRT setting means that no job is released when the machine is busy. In this paper, we consider the above model under two environments: (1) KRT setting and (2) general setting. In the KRT setting, we provide the lower bounds 1 + f2 −f+1−1 f for b ≥ f and min 2f+1 f+2 , 2b b+1 for 2 ≤ b < f. In the general setting, we provide the lower bounds 1 + 4f2 +1−1 2f for b ≥ f + 1 and 2b b+1 for 2 ≤ b < f + 1. We further present an online algorithm, which is the best possible when b ≥ f for the KRT setting and when b ≥ f + 1 for the general setting.

Suggested Citation

  • Libo Wang & Wenhua Li & Xing Chai & Yanhong Gao & Dan Yu, 2025. "Online Scheduling on a Bounded Batch Machine with Same-Length-Job Families," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 42(05), pages 1-19, October.
    • Handle: RePEc:wsi:apjorx:v:42:y:2025:i:05:n:s0217595925500046
    DOI: 10.1142/S0217595925500046
    as

    Download full text from publisher

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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:wsi:apjorx:v:42:y:2025:i:05:n:s0217595925500046. 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.