Skip to main content
Log in

Approximation algorithms for batch scheduling with processing set restrictions

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

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\) for identical batch capacities.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M. Y., Potts, C. N., Tautenhahn, T., & van de Velde, S. L. (1998). Scheduling a batching machine. Journal of Scheduling, 1(1), 31–54.

    Article  Google Scholar 

  • Epstein, L., & Levin, A. (2011). Scheduling with processing set restrictions: PTAS results for several variants. International Journal of Production Economics, 133(2), 586–595.

    Article  Google Scholar 

  • Lawler, E. L., Lenstra, J. K. Rinnooy Kan, A. H. G. & Shmoys, D. B. (1993). Sequencing and scheduling: Algorithms and complexity. In Handbooks in Operations Research and Management Science, Logistics of Production and Inventory, Vol. 4, (pp. 445–522). Elsevier.

  • Lee, C. Y., & Uzsoy, R. (1999). Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research, 37(1), 219–236.

    Article  Google Scholar 

  • Leung, J.Y.-T., & Li, C.-L. (2016). Scheduling with processing set restrictions: A literature update. International Journal of Production Economics, 175, 1–11.

    Article  Google Scholar 

  • Leung, J.Y.-T., & Ng, C. T. (2017). Fast approximation algorithms for uniform machine scheduling with processing set restrictions. European Journal of Operational Research, 260(2), 507–513.

    Article  Google Scholar 

  • Li, S. G. (2017). Parallel batch scheduling with nested processing set restrictions. Theoretical Computer Science, 689, 117–125.

    Article  Google Scholar 

  • Li, S. G. (2017). Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan. European Journal of Operational Research, 260(1), 12–20.

    Article  Google Scholar 

  • Ng, C. T., Cheng, T. C. E., Levner, E., & Kriheli, B. (2021). Optimal bi-criterion planning of rescue and evacuation operations for marine accidents using an iterative scheduling algorithm. Annals of Operations Research, 296, 407–420.

    Article  Google Scholar 

  • Poon, C. K., & Yu, W. C. (2005). On-line scheduling algorithms for a batch machine with finite capacity. Journal of Combinatorial Optimization, 9(2), 167–186.

    Article  Google Scholar 

Download references

Acknowledgements

We thank two anonymous referees for their helpful comments. This research was supported in part by the National Natural Science Foundation of China under grant numbers 12001169, 11971443, 11771406, and 61971380. It was also supported in part by the University Grants Council of Hong Kong under grant number PolyU 152148/15E.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wenhua Li.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chai, X., Li, W., Ng, C.T. et al. Approximation algorithms for batch scheduling with processing set restrictions. J Sched 26, 523–533 (2023). https://doi.org/10.1007/s10951-022-00720-2

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-022-00720-2

Keywords

Navigation