IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v25y2025i2d10.1007_s12351-025-00921-5.html
   My bibliography  Save this article

A note: approximation algorithms for batch scheduling on shops with job rejection

Author

Listed:
  • Gur Mosheiov

    (The Hebrew University
    Lev Academic Center)

  • Assaf Sarig

    (The Hebrew University)

Abstract

The most popular and cited model of batch scheduling was introduced and solved almost four decades ago. This pioneering model assumed a single machine, serial batching of unit-time jobs and batch-independent setup times. In the current note, we extend this setting by (i) allowing job-rejection, and (ii) considering flowshop and openshop. The objective function contains two cost components: sum of job completion times and total rejection cost. We introduce approximation algorithms for these problems, which are based on solving to optimality the relaxed versions (allowing non-integer batches) in the first stage, followed by rounding procedures to create integer batches. The results of our numerical tests verify that these efficient approximation algorithms produce very close-to-optimal schedules.

Suggested Citation

  • Gur Mosheiov & Assaf Sarig, 2025. "A note: approximation algorithms for batch scheduling on shops with job rejection," Operational Research, Springer, vol. 25(2), pages 1-14, June.
    • Handle: RePEc:spr:operea:v:25:y:2025:i:2:d:10.1007_s12351-025-00921-5
    DOI: 10.1007/s12351-025-00921-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-025-00921-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12351-025-00921-5?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:spr:operea:v:25:y:2025:i:2:d:10.1007_s12351-025-00921-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.