Abstract
In this paper, we design a 2-approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties based on Lovász rounding technique, which improves the corresponding result obtained in Zheng et al. (J. Oper. Res. Soc. China, 2022).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahmadi, R., Bagchi, U.: Scheduling of Multi-job Customer Orders in Multi-machine Environments. ORSA/TIMS, Philadelphia (1990)
Chen, R., Li, S.: Minimizing maximum delivery completion time for order scheduling with rejection. J. Comb. Optim. 40, 1044–1064 (2020)
Du, D., Lu, R., Xu, D.: A primal-dual approximation algorithm for the facility location problem with submodular penalties. Algorithmica 63(1–2), 191–200 (2012)
Fujishige, S.: Submodular Functions and Optimization, 2nd edn. Elsevier, Amsterdam (2005)
Leung, J.Y.T., Li, H., Pinedo, M.: Order scheduling in an environment with dedicated resources in parallel. J. Sched. 8(5), 355–386 (2005)
Leung, J.Y.T., Li, H., Pinedo, M.: Scheduling orders for multiple product types with due date related objectives. Eur. J. Oper. Res. 168(2), 370–389 (2006)
Liu, X., Li, W.: Approximation algorithm for the single machine scheduling problem with release dates and submodular rejection penalty. Mathematics 8, 133 (2020)
Liu, X., Li, W.: Approximation algorithms for the multiprocessor scheduling with submodular penalties. Optim. Lett. 15, 2165–2180 (2021)
Lovász, L.: Submodular functions and convexity. In: Bachm, A., Grtschel, M., Korte, B. (eds.) Mathematical Programing the State of the Art, pp. 235–237. Springer, Berlin (1983)
Wang, W., Liu, X.: Combinatorial 2-Approximation algorithm for the parallel-machine scheduling with release times and submodular penalties. Mathematics 10, 61 (2022)
Xu, D., Wang, F., Du, D., Wu, C.: Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique. Theor. Comput. Sci. 630, 117–125 (2016)
Zhang, X., Xu, D., Du, D., Wu, C.: Approximation algorithms for precedence-constrained identical machine scheduling with rejection. J. Comb. Optim. 35(1), 318–330 (2018)
Zheng, H., Gao, S., Liu, W., Hou, B.: An approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties. J. Oper. Res. Soc. China (2022). https://doi.org/10.1007/s40305-022-00430-8
Zheng, H., Gao, S., Liu, W., Wu, W., Du, D., Hou, B.: Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties. J. Comb. Optim. 44, 343–353 (2022)
Acknowledgements
The authors would like to thank the referee for giving this paper a careful reading and many valuable comments and useful suggestions. This work was supported by the NSF of China (No. 11971146), the NSF of Hebei Province of China (No. A2023205009 and No. A2023205015) and the Graduate Innovation Grant Program of Hebei Normal University (No. CXZZSS2022053).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Hou, B., Zheng, H., Liu, W. et al. Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties. Optim Lett (2023). https://doi.org/10.1007/s11590-023-02073-x
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11590-023-02073-x