Abstract
Platform resource scheduling is an operational research optimization problem of matching tasks and platform resources, which has important applications in production or marketing arrangement layout, combat task planning, etc. The existing algorithms are inflexible in task planning sequence and have poor stability. Aiming at this defect, the branch-and-bound algorithm is combined with the genetic algorithm in this paper. Branch-and-bound algorithm can adaptively adjust the next task to be planned and calculate a variety of feasible task planning sequences. Genetic algorithm is used to assign a platform combination to the selected task. Besides, we put forward a new lower bound calculation method and pruning rule. On the basis of the processing time of the direct successor tasks, the influence of the resource requirements of tasks on the priority of tasks is considered. Numerical experiments show that the proposed algorithm has good performance in platform resource scheduling problem.
Similar content being viewed by others
Data Availability
All case datas are from references, the specific references have been noted in the text. All experimental datas included in the submission.
Code Availability
The Python code in this article is available. If anyone needs this, they can get it by contacting the author.
References
Blazewicz J, Lenstra JK, Kan AHGR (1983) Scheduling subject to resource constraints: classification and complexity. Discret Appl Math 5(1):11–24
Levchuk GM, Levchuk Y, Luo J, Pattipati KR (2002) Normative design of organizations-Part I: mission planning. IEEE Trans Syst Man Cybern-Part A Syst Hum 32(3):346–359. https://doi.org/10.1109/TSMCA.2002.802819
Yang DS, Zhang WM, Liu Z, Lu YL (2006) Research on mathematical description ang solving algorithms of tasks scheduling for campaign. Syst Eng Theory Pract 26(1):26–34
Zhang JY, Yao PY, Zhou XX, Wang X (2012) Approach to operation tasks and plarform resource matching Based on DLS and GA. Syst Eng Electron 34(5):947–954
Zhou XX, Yao PY, Zhang JY, Wang X (2012) Platform resource scheduling method based on DLS and ACO. Comput Sci 39(06):98–103
Wang W, Liu FX (2017) Task allocation model and its algorithm for cooperative combat of multiple platforms. Electron Opt Control 24(12):11–15+21
Jin YD, Yang HH, Duan PF (2017) Approach to operation task and platform resource matching based on CS and MPLDS. Comput Simul 34(02):5–9+254
Lin H, Tang SH, Cheng JJ (2021) Research on joint operations resource scheduling based on MDLS and ANN. Mil Oper Res Syst Eng 35(04):42–46. https://doi.org/10.19949/j.ams.mora.20210313.01
Stinson JP, Davis EW, Khumawala BM (1978) Multiple resource-constrained scheduling using branch and bound. AIIE Trans 10(3):252–259
Demeulemeester E, Herroelen W (1992) A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Manag Sci 38(12):1803–1818. https://doi.org/10.1287/mnsc.38.12.1803
Mingozzi A, Maniezzo V, Ricciardelli S, Bianco L (1998) An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation. Manag Sci 44(5):714–729. https://doi.org/10.1287/mnsc.44.5.714
Coelho J, Vanhoucke M (2018) An exact composite lower bound strategy for the resource-constrained project scheduling problem. Comput Oper Res 93:135–150. https://doi.org/10.1016/j.cor.2018.01.017
Shi Y (2022) Advances in big data analytics: theory, algorithm and practice. Springer, Singapore
Olson DL, Shi Y (2007) Introduction to business data mining. McGraw-Hill, New York
Shi Y, Tian YJ, Kou G, Peng Y, Li JP (2011) Optimization based data mining: theory and applications. Springer, Berlin
Tien JM (2017) Internet of things, real-time decision making, and artificial intelligence. Ann Data Sci 4(2):149–178. https://doi.org/10.1007/s40745-017-0112-5
Sohail A (2021) Genetic algorithms in the fields of artificial intelligence and data sciences. Ann Data Sci. https://doi.org/10.1007/s40745-021-00354-9
Lu QH, Li SS, Zhang WS, Zhang L (2016) A genetic algorithm-based job scheduling model for big data analytics. EURASIP J Wirel Commun Netw 1:1–9
Xia J, Yan YC, Ji L (2022) Research on control strategy and policy optimal scheduling based on an improved genetic algorithm. Neural Comput Appl 34(12):9485–9497. https://doi.org/10.1007/s00521-021-06415-7
Zhai JH, Song DD (2022) Optimal instance subset selection from big data using genetic algorithm and open source framework. J Big Data 9(1):1–18
Cai WJ, Li C, Tu LP (2020) Combat resource planning for carrier-borne aircraft formation based on multi-priority task chain. Command Inf Syst Technol 11(05):66–71+77. https://doi.org/10.15908/j.cnki.cist.2020.05.012
Goncharov EN, Leonov VV (2017) Genetic algorithm for the resource-constrained project scheduling problem. Autom Remote Control 78(6):1101–1114
Kadri RL, Boctor FF (2018) An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: the single mode case. Eur J Oper Res 265(2):454–462
Liu J, Liu YS, Shi Y, Li J (2020) Solving resource-constrained project scheduling problem via genetic algorithm. J Comput Civ Eng 34(2):04019055.1. https://doi.org/10.1061/(ASCE)CP.1943-5487.0000874
Poppenborg J, Knust S (2016) A flow-based tabu search algorithm for the RCPSP with transfer times. OR Spectrum 38(2):305–334
Patterson JH (1984) A comparison of exact approaches for solving the multiple constrained resource, project scheduling problem. Manag Sci 30(7):854–867
Ren Y, Lu Z, Liu X (2020) A branch-and-bound embedded genetic algorithm for resource-constrained project scheduling problem with resource transfer time of aircraft moving assembly line. Optim Lett 14(8):2161–2195. https://doi.org/10.1007/s11590-020-01542-x
Suresh M, Dutta P, Jain K (2015) Resource constrained multi-project scheduling problem with resource transfer times. Asia-Pac J Oper Res 32(06):1550048
Sun Y, Mao SJ, Zhou Y, Mao XB, Zhu XQ (2021) Operational resource scheduling method under complex task relation constraint. Command Inf Syst Technol 12(6):39–44. https://doi.org/10.15908/j.cnki.cist.2021.06.007
Wang X, Yao Y, Zhang JY, Wang LJ, Jiao ZQ (2019) Dynamic resource scheduling for C2 organizations based on multi-objective optimization. IEEE Access 7:64614–64626. https://doi.org/10.1109/ACCESS.2019.2914951
Sun Y, Yao PY, Zhang SH, Xiao Y (2017) Dynamic battlefield resource scheduling model and algorithm with interval parameters. Syst Eng Theory Pract 37(04):1080–1088. https://doi.org/10.12011/1000-6788(2017)04-1080-09
Lu YL, Yang DS, Liu Z, Dai CH (2006) Research on algorithm of resource allocating in joint operation. Fire Control Command Control 02:12–16
Wan LJ, Yao PY, Zhou XX, Shui DD (2014) Cooperative task allocation methods in multiple groups using DLS-QGA. Control Decis 29(09):1562–1568. https://doi.org/10.13195/j.kzyjc.2013.0876
Funding
This work is supported by the National Natural Science Foundation of China (Grant No. 11771003).
Author information
Authors and Affiliations
Contributions
All authors made significant contributions to the preparation and writing of the manuscript.
Corresponding authors
Ethics declarations
Confict of interest
The authors declare that they have no conflict of interest.
Ethics Approval
We declare that the manuscript does not contain research that has been published or written by others.
Consent to Participate
Not applicable.
Consent for Publication
Agree with publication.
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
Zhang, Y., Ma, J., Zhang, H. et al. Platform Resource Scheduling Method Based on Branch-and-Bound and Genetic Algorithm. Ann. Data. Sci. 10, 1421–1445 (2023). https://doi.org/10.1007/s40745-023-00470-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40745-023-00470-8