IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v26y2023i6d10.1007_s10951-022-00720-2.html
   My bibliography  Save this article

Approximation algorithms for batch scheduling with processing set restrictions

Author

Listed:
  • Xing Chai

    (Zhengzhou University
    Henan University of Technology)

  • Wenhua Li

    (Zhengzhou University)

  • C. T. Ng

    (The Hong Kong Polytechnic University)

  • T. C. E. Cheng

    (The Hong Kong Polytechnic University)

Abstract

We consider batch scheduling on m machines to minimize the makespan. Each job has a given set of machines to be assigned. Each machine can process several jobs simultaneously as a batch, and the machines may have different batch capacities. We study two models: (i) scheduling on equal-speed batch machines under a nested processing set restriction, where the machines have the same processing speed, and (ii) scheduling on uniform batch machines under a tree-hierarchical processing set restriction, where the machines have different processing speeds. For both models we design polynomial-time approximation algorithms to solve them. The algorithms have a worst-case ratio of 2 for non-identical batch capacities and a worst-case ratio of $$2-1/m$$ 2 - 1 / m for identical batch capacities.

Suggested Citation

  • Xing Chai & Wenhua Li & C. T. Ng & T. C. E. Cheng, 2023. "Approximation algorithms for batch scheduling with processing set restrictions," Journal of Scheduling, Springer, vol. 26(6), pages 523-533, December.
    • Handle: RePEc:spr:jsched:v:26:y:2023:i:6:d:10.1007_s10951-022-00720-2
    DOI: 10.1007/s10951-022-00720-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-022-00720-2
    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/s10951-022-00720-2?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.

    References listed on IDEAS

    as
    1. Leung, Joseph Y.-T. & Li, Chung-Lun, 2016. "Scheduling with processing set restrictions: A literature update," International Journal of Production Economics, Elsevier, vol. 175(C), pages 1-11.
    2. Chi To Ng & T. C. E. Cheng & Eugene Levner & Boris Kriheli, 2021. "Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm," Annals of Operations Research, Springer, vol. 296(1), pages 407-420, January.
    3. Li, Shuguang, 2017. "Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan," European Journal of Operational Research, Elsevier, vol. 260(1), pages 12-20.
    4. Epstein, Leah & Levin, Asaf, 2011. "Scheduling with processing set restrictions: PTAS results for several variants," International Journal of Production Economics, Elsevier, vol. 133(2), pages 586-595, October.
    5. Leung, Joseph Y-T. & Ng, C.T., 2017. "Fast approximation algorithms for uniform machine scheduling with processing set restrictions," European Journal of Operational Research, Elsevier, vol. 260(2), pages 507-513.
    6. Chung Keung Poon & Wenci Yu, 2005. "On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity," Journal of Combinatorial Optimization, Springer, vol. 9(2), pages 167-186, March.
    7. Chung Poon & Wenci Yu, 2005. "A Flexible On-line Scheduling Algorithm for Batch Machine with Infinite Capacity," Annals of Operations Research, Springer, vol. 133(1), pages 175-181, January.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Qi Wang & Bo Hou & Gengsheng Zhang & Yisheng Zhou & Wen Liu, 2025. "Approximation algorithms for the partition set cover problem with penalties," Journal of Combinatorial Optimization, Springer, vol. 49(5), pages 1-15, July.
    2. Tianjiao Guo & Wen Liu & Gengsheng Zhang & Bo Hou, 2025. "Approximation algorithms for the W-prize-collecting scheduling problem on a single machine with submodular rejection penalties," Journal of Combinatorial Optimization, Springer, vol. 49(5), pages 1-13, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yang Fang & Peihai Liu & Xiwen Lu, 2011. "Optimal on-line algorithms for one batch machine with grouped processing times," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 509-516, November.
    2. Averbakh, Igor, 2010. "On-line integrated production-distribution scheduling problems with capacitated deliveries," European Journal of Operational Research, Elsevier, vol. 200(2), pages 377-384, January.
    3. Chengwen Jiao & Jinjiang Yuan & Qi Feng, 2019. "Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(05), pages 1-8, October.
    4. Leung, Joseph Y-T. & Ng, C.T., 2017. "Fast approximation algorithms for uniform machine scheduling with processing set restrictions," European Journal of Operational Research, Elsevier, vol. 260(2), pages 507-513.
    5. Li, Shuguang, 2017. "Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan," European Journal of Operational Research, Elsevier, vol. 260(1), pages 12-20.
    6. Ridouard, Frédéric & Richard, Pascal & Martineau, Patrick, 2008. "On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1327-1342, September.
    7. Zhang, Jun & Wang, Xuping & Huang, Kai, 2018. "On-line scheduling of order picking and delivery with multiple zones and limited vehicle capacity," Omega, Elsevier, vol. 79(C), pages 104-115.
    8. Li, Shuguang, 2017. "Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities," European Journal of Operational Research, Elsevier, vol. 263(3), pages 815-826.
    9. Li, Weidong & Ou, Jinwen, 2024. "Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing," European Journal of Operational Research, Elsevier, vol. 314(3), pages 882-893.
    10. Ruyan Fu & Ji Tian & Shisheng Li & Jinjiang Yuan, 2017. "An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities," Journal of Combinatorial Optimization, Springer, vol. 34(4), pages 1187-1197, November.
    11. Sonia Ben Mokhtar & Louis-Claude Canon & Anthony Dugois & Loris Marchal & Etienne Rivière, 2024. "A scheduling framework for distributed key-value stores and its application to tail latency minimization," Journal of Scheduling, Springer, vol. 27(2), pages 183-202, April.
    12. Nong, Qingqin & Yuan, Jinjiang & Fu, Ruyan & Lin, Lin & Tian, Ji, 2008. "The single-machine parallel-batching on-line scheduling problem with family jobs to minimize makespan," International Journal of Production Economics, Elsevier, vol. 111(2), pages 435-440, February.
    13. 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).
    14. Leung, Joseph Y.-T. & Li, Chung-Lun, 2016. "Scheduling with processing set restrictions: A literature update," International Journal of Production Economics, Elsevier, vol. 175(C), pages 1-11.
    15. Ege Duran & Cemalettin Ozturk & M. Arslan Ornek, 2025. "Combinatorial optimization methods for yarn dyeing planning," Flexible Services and Manufacturing Journal, Springer, vol. 37(1), pages 282-319, March.
    16. Jinjiang Yuan & Shisheng Li & Ji Tian & Ruyan Fu, 2009. "A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times," Journal of Combinatorial Optimization, Springer, vol. 17(2), pages 206-213, February.
    17. Jinwen Ou & Xueling Zhong & Xiangtong Qi, 2016. "Scheduling parallel machines with inclusive processing set restrictions and job rejection," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(8), pages 667-681, December.
    18. Peihai Liu & Xiwen Lu, 2015. "Online unbounded batch scheduling on parallel machines with delivery times," Journal of Combinatorial Optimization, Springer, vol. 29(1), pages 228-236, January.
    19. Hailing Liu & Jinjiang Yuan & Wenjie Li, 2016. "Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1609-1622, May.
    20. Huiqiao Su & Michael Pinedo & Guohua Wan, 2017. "Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(3), pages 249-267, April.

    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:jsched:v:26:y:2023:i:6:d:10.1007_s10951-022-00720-2. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.