Skip to main content
SpringerLink
Log in

Algorithm-Aware Makespan Minimisation for Software Testing Under Uncertainty

  • Conference paper
  • First Online:
Book cover Engineering in Dependability of Computer Systems and Networks (DepCoS-RELCOMEX 2019)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 987))

Included in the following conference series:

Abstract

In this paper a modification of the parallel machines scheduling problem with machines capacity for the purpose of running software tests in a cloud environment is considered. The goal function to minimise is the sum of the makespan and the time needed to obtain the schedule. The processing times of tests are unknown, but can be estimated with the use of the history of execution of previous tests. A mathematical model of the problem is presented and two solving methods, adapted Largest Processing Time algorithm and Simulated Annealing metaheuristics are implemented and compared in a computer experiment using real-life data. The results indicate that the Simulated Annealing method is better up to around \(14\,000\) tests despite its longer running time. Results also show that, when paired with a simple method of estimation of software tests duration, both solving methods are fairly robust, providing schedules with similar quality to the ones obtained without estimation.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Binder, R.V.: Optimal scheduling for combinatorial software testing and design of experiments. In: 2018 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW), pp. 295–301 (2018). https://doi.org/10.1109/ICSTW.2018.00063

  2. Bożejko, W., Pempera, J., Smutnicki, C.: Parallel simulated annealing for the job shop scheduling problem. In: Allen, G., Nabrzyski, J., Seidel, E., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) Computational Science - ICCS 2009, pp. 631–640. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Centeno, G., Armacost, R.L.: Minimizing makespan on parallel machines with release time and machine eligibility restrictions. Int. J. Prod. Res. 42(6), 1243–1256 (2004). https://doi.org/10.1080/00207540310001631584

    Article  MATH  Google Scholar 

  4. Cheng, B., Yang, S., Hu, X., Chen, B.: Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes. Appl. Math. Modell. 36(7), 3161–3167 (2012). https://doi.org/10.1016/j.apm.2011.09.061

    Article  MathSciNet  MATH  Google Scholar 

  5. Garey, M.R., Johnson, D.S.: “Strong” NP-completeness results: motivation, examples, and implications. J. ACM 25(3), 499–508 (1978). https://doi.org/10.1145/322077.322090

    Article  MathSciNet  MATH  Google Scholar 

  6. Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17(2), 416–429 (1969)

    Article  MathSciNet  Google Scholar 

  7. Kumar, D., Mishra, K.: The impacts of test automation on software’s cost, quality and time to market. Procedia Comput. Sci. 79, 8–15 (2016). https://doi.org/10.1016/j.procs.2016.03.003

    Article  Google Scholar 

  8. Lampe, P., Rudy, J.: Models and scheduling algorithms for a software testing system over cloud. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds.) Contemporary Complex Systems and Their Dependability, pp. 326–337. Springer International Publishing, Cham (2019)

    Chapter  Google Scholar 

  9. Lastovetsky, A.: Parallel testing of distributed software. Inf. Softw. Technol. 47(10), 657–662 (2005). https://doi.org/10.1016/j.infsof.2004.11.006

    Article  Google Scholar 

  10. Su, H., Pinedo, M., Wan, G.: Parallel machine scheduling with eligibility constraints: a composite dispatching rule to minimize total weighted tardiness. Naval Res. Logistics (NRL) 64(3), 249–267 (2017). https://doi.org/10.1002/nav.21744

    Article  MathSciNet  Google Scholar 

  11. Wang, H.M., Chou, F.D.: Solving the parallel batch-processing machines with different release times, job sizes, and capacity limits by metaheuristics. Expert Syst. Appl. 37(2), 1510–1521 (2010). https://doi.org/10.1016/j.eswa.2009.06.070

    Article  Google Scholar 

  12. Yu, C., Semeraro, Q., Matta, A.: A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility. Comput. Oper. Res. 100, 211–229 (2018). https://doi.org/10.1016/j.cor.2018.07.025. http://www.sciencedirect.com/science/article/pii/S030505481830217X

    Article  MathSciNet  MATH  Google Scholar 

  13. Yu, L., Tsai, W.T., Chen, X., Liu, L., Zhao, Y., Tang, L., Zhao, W.: Testing as a service over cloud. In: Proceedings of the 2010 Fifth IEEE International Symposium on Service Oriented System Engineering, SOSE 2010, pp. 181–188. IEEE Computer Society, Washington, DC (2010). https://doi.org/10.1109/SOSE.2010.36

  14. Zheng, Y., Cai, L., Huang, S., Lu, J., Liu, P.: Cloud testing scheduling based on improved ACO. In: International Symposium on Computers & Informatics (ISCI 2015), pp. 569–578 (2015). https://doi.org/10.2991/isci-15.2015.76

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Wrocław University of Science and Technology, Wybrzeże Wyspiańskiego 27, 50-370, Wrocław, Poland

    Jarosław Rudy

Authors
  1. Jarosław Rudy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jarosław Rudy .

Editor information

Editors and Affiliations

  1. Wrocław University of Science and Technology, Wroclaw, Poland

    Wojciech Zamojski

  2. Wrocław University of Science and Technology, Wroclaw, Poland

    Jacek Mazurkiewicz

  3. Wrocław University of Science and Technology, Wroclaw, Poland

    Jarosław Sugier

  4. Wrocław University of Science and Technology, Wroclaw, Poland

    Tomasz Walkowiak

  5. Systems Research Institute, Polish Academy of Sciences, Warsaw, Poland

    Janusz Kacprzyk

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rudy, J. (2020). Algorithm-Aware Makespan Minimisation for Software Testing Under Uncertainty. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds) Engineering in Dependability of Computer Systems and Networks. DepCoS-RELCOMEX 2019. Advances in Intelligent Systems and Computing, vol 987. Springer, Cham. https://doi.org/10.1007/978-3-030-19501-4_43

Download citation

Publish with us

Policies and ethics

Search

Navigation