Skip to main content

Advertisement

Springer Nature Link
Log in

Optimization of parallel test task scheduling with constraint satisfaction

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Parallel test task scheduling is an efficient way to shorten the final makespan of several huge test projects. Put simply, a set of test tasks should be processed on several unrelated resources, and several test tasks must satisfy the predetermined technological test order. The objective of the investigated problem is to minimize the makespan. To tackle the problem, a recursive search artificial bee colony algorithm (RS-ABC) is proposed. The recursive search procedure is developed to obtain a series of implied sequences of the predetermined technological test order on the recursive tree. The artificial bee colony (ABC) algorithm is devised to find the schedule with minimum makespan by utilizing the implied sequences. To evaluate the performance of RS-ABC, small and large size instance problems are solved, and the results are compared with those of the latest algorithm and one state-of-the-art solver. The experimental results show that RS-ABC is encouraging in solving the parallel test task scheduling problem. This work can help users design an effective test plan for the shortest completion time.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Data availability statement

Data available within the article and its supplementary materials. The authors confirm that the data supporting the findings of this study are available within the article and its supplementary materials.

References

  1. Jain V, Grossmann IE (1999) Resource-constrained scheduling of tests in new product development. Ind Eng Chem Res 38(8):3013–3026. https://doi.org/10.1021/ie9807809

    Article  Google Scholar 

  2. Yang Z, Xiao H-S, Guan R, Yang Y, Ji H-L (2021) Task scheduling for multiunit parallel test using mixed-integer linear programming. Math Probl Eng 2021:1–13. https://doi.org/10.1155/2021/3785452

    Article  Google Scholar 

  3. Sulaiman M, Halim Z, Waqas M, Aydın D (2021) A hybrid list-based task scheduling scheme for heterogeneous computing. J Supercomput 77(9):10252–10288. https://doi.org/10.1007/s11227-021-03685-9

    Article  Google Scholar 

  4. Sharma R, Nitin N, AlShehri MAR, Dahiya D (2021) Priority-based joint EDF–RM scheduling algorithm for individual real-time task on distributed systems. J Supercomput 77(1):890–908. https://doi.org/10.1007/s11227-020-03306-x

    Article  Google Scholar 

  5. Liao X, Zhang H, Koshimura M, Huang R, Yu W, Li F (2021) Modeling and solving scheduling in overloaded situations with weighted partial MaxSat. Math Probl Eng 2021:1–17. https://doi.org/10.1155/2021/9615463

    Article  Google Scholar 

  6. Lu H, Zhu Z, Wang X, Yin L (2014) A variable neighborhood moea/d for multiobjective test task scheduling problem. Math Probl Eng 2014:1–14. https://doi.org/10.1155/2014/423621

    Article  MathSciNet  MATH  Google Scholar 

  7. Lu H, Yin L, Wang X, Zhang M, Mao K (2014) Chaotic multiobjective evolutionary algorithm based on decomposition for test task scheduling problem. Math Probl Eng 2014:1–25. https://doi.org/10.1155/2014/640764

    Article  MathSciNet  MATH  Google Scholar 

  8. Lu H, Xu X, Zhang M, Yin L (2015) Dynamic multi-objective evolutionary algorithm based on decomposition for test task scheduling problem. In: 2015 Sixth International Conference on Intelligent Control and Information Processing (ICICIP), IEEE, Wuhan, China, pp 11–18. https://doi.org/10.1109/ICICIP.2015.7388136

  9. Lu H, Niu R, Liu J, Zhu Z (2013) A chaotic non-dominated sorting genetic algorithm for the multi-objective automatic test task scheduling problem. Appl Soft Comput 13(5):2790–2802. https://doi.org/10.1016/j.asoc.2012.10.001

    Article  Google Scholar 

  10. Wu H, Nie C, Kuo F-C (2016) The optimal testing order in the presence of switching cost. Inf Softw Technol 80:57–72. https://doi.org/10.1016/j.infsof.2016.08.006

    Article  Google Scholar 

  11. Lu H, Zhou R, Fei Z, Shi J (2018) A multi-objective evolutionary algorithm based on pareto prediction for automatic test task scheduling problems. Appl Soft Comput 66:394–412. https://doi.org/10.1016/j.asoc.2018.02.050

    Article  Google Scholar 

  12. Do Ngoc A-D, Lee S-H, Moon I (2014) Hybrid genetic algorithm for test bed scheduling problems. Int J Prod Res 52(4):1074–1089. https://doi.org/10.1080/00207543.2013.838327

    Article  Google Scholar 

  13. Lu H, Zhang M (2015) Non-integrated algorithm based on eda and tabu search for test task scheduling problem. In: 2015 IEEE AUTOTESTCON, IEEE, National Harbor, MD, USA, pp 261–268. https://doi.org/10.1109/AUTEST.2015.7356500

  14. Shi J, Lu H, Mao K (2016) Solving the test task scheduling problem with a genetic algorithm based on the scheme choice rule. In: Tan Y, Shi Y, Li L (eds) Advances in swarm intelligence, vol 9713. Springer, Cham, pp 19–27. https://doi.org/10.1007/978-3-319-41009-8_3. https://data.mendeley.com/datasets/bp8gf34wnm

    Chapter  Google Scholar 

  15. Zhang Y, Jiang S, Wang X, Chen R, Zhang M (2019) An optimization algorithm applied to the class integration and test order problem. Soft Comput 23(12):4239–4253. https://doi.org/10.1007/s00500-018-3077-1

    Article  Google Scholar 

  16. Dohmen M (1995) A survey of constraint satisfaction techniques for geometric modeling. Comput Graph 19(6):831–845. https://doi.org/10.1016/0097-8493(95)00055-0

    Article  Google Scholar 

  17. Hower W (1995) Constraint satisfaction-algorithms and complexity analysis. Inf Process Lett 55(3):171–178. https://doi.org/10.1016/0020-0190(95)00089-U

    Article  MathSciNet  MATH  Google Scholar 

  18. Barták R, Salido MA (2011) Constraint satisfaction for planning and scheduling problems. Constraints 16(3):223–227. https://doi.org/10.1007/s10601-011-9109-4

    Article  MathSciNet  MATH  Google Scholar 

  19. Guan B, Zhao Y, Li Y (2019) An ant colony optimization based on information entropy for constraint satisfaction problems. Entropy 21(8):766. https://doi.org/10.3390/e21080766

    Article  MathSciNet  Google Scholar 

  20. Kupriyanov BV, Lazarev AA (2021) Optimization of a recursive conveyor by reduction to a constraint satisfaction problem. Autom Remote Control 82(11):1892–1906. https://doi.org/10.1134/S0005117921110059

    Article  MATH  Google Scholar 

  21. Grover A, Achim T, Ermon S (2019) Streamlining variational inference for constraint satisfaction problems. J Stat Mech Theory Exp 2019(12):124006. https://doi.org/10.1088/1742-5468/ab371f

    Article  MathSciNet  MATH  Google Scholar 

  22. Bogaerts B, Gamba E, Guns T (2021) A framework for step-wise explaining how to solve constraint satisfaction problems. Artif Intell 300:103550. https://doi.org/10.1016/j.artint.2021.103550

    Article  MathSciNet  MATH  Google Scholar 

  23. Habet D, Terrioux C (2021) Conflict history based heuristic for constraint satisfaction problem solving. J Heuristics 27(6):951–990. https://doi.org/10.1007/s10732-021-09475-z

    Article  Google Scholar 

  24. Li H, Feng G, Yin M (2020) On combining variable ordering heuristics for constraint satisfaction problems. J Heuristics 26(4):453–474. https://doi.org/10.1007/s10732-019-09434-9

    Article  Google Scholar 

  25. Meshkati J, Faramarz S-E (2019) Energy-aware resource utilization based on particle swarm optimization and artificial bee colony algorithms in cloud computing. J Supercomput 75(5):2455–2496. https://doi.org/10.1007/s11227-018-2626-9

    Article  Google Scholar 

  26. Du Z, Han D, Li K-C (2019) Improving the performance of feature selection and data clustering with novel global search and elite-guided artificial bee colony algorithm. J Supercomput 75(8):5189–5226. https://doi.org/10.1007/s11227-019-02786-w

    Article  Google Scholar 

  27. Maravelias CT, Grossmann IE (2004) Optimal resource investment and scheduling of tests for new product development. Comput Chem Eng 28(6–7):1021–1038. https://doi.org/10.1016/j.compchemeng.2003.09.019

    Article  Google Scholar 

  28. Christos MT, Ignacio GE (2006) Logic inference and a decomposition algorithm for the resource-constrained scheduling of testing tasks in the development of new pharmaceutical and agrochemical products. In: Handbook on Modelling for Discrete Optimization. International Series in Operations Research & Management Science, vol 88. Springer, New York, pp 265–289. https://doi.org/10.1007/0-387-32942-0_9

  29. Sundar S, Suganthan PN, Jin CT, Xiang CT, Soon CC (2017) A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint. Soft Comput 21(5):1193–1202. https://doi.org/10.1007/s00500-015-1852-9

    Article  Google Scholar 

  30. Gao J, Zhu X, Bai K, Zhang R (2021) New controllable processing time scheduling with subcontracting strategy for no-wait job shop problem. Int J Prod Res. https://doi.org/10.1080/00207543.2021.1886368

    Article  Google Scholar 

  31. Gao J, Zhu X, Zhang R (2022) A branch-and-price approach to the multitasking scheduling with batch control on parallel machines. Int Trans Oper Res. https://doi.org/10.1111/itor.13110

    Article  MathSciNet  Google Scholar 

  32. Samarghandi H (2019) Solving the no-wait job shop scheduling problem with due date constraints: a problem transformation approach. Comput Ind Eng 136:635–662. https://doi.org/10.1016/j.cie.2019.07.054

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by the Key Research and Development Project of Guangdong Province [Grant Number 2021B0101420003] and the Beijing Natural Science Foundation [Grant Number L201003].

Author information

Author notes

  1. Jinsheng Gao, Xiaomin Zhu and Runtong Zhang have contributed equally to this work.

Authors and Affiliations

  1. School of Mechanical, Electronic and Control Engineering, Beijing Jiaotong University, No.3 Shangyuancun Haidian District, Beijing, 100044, China

    Jinsheng Gao & Xiaomin Zhu

  2. School of Economics and Management, Beijing Jiaotong University, No.3 Shangyuancun Haidian District, Beijing, 100044, China

    Runtong Zhang

Authors
  1. Jinsheng Gao
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Xiaomin Zhu
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Runtong Zhang
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Xiaomin Zhu.

Ethics declarations

Conflict of interest

The authors declare no conflict of interest.

Additional information

Publisher's Note

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

Supplementary Information

Below is the link to the electronic supplementary material.

Supplementary file 1 (rar 18031 KB)

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.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gao, J., Zhu, X. & Zhang, R. Optimization of parallel test task scheduling with constraint satisfaction. J Supercomput 79, 7206–7227 (2023). https://doi.org/10.1007/s11227-022-04943-0

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-022-04943-0

Keywords