{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:20:49Z","timestamp":1743099649342,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030195007"},{"type":"electronic","value":"9783030195014"}],"license":[{"start":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T00:00:00Z","timestamp":1557619200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-19501-4_43","type":"book-chapter","created":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T11:37:08Z","timestamp":1557574628000},"page":"435-445","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algorithm-Aware Makespan Minimisation for Software Testing Under Uncertainty"],"prefix":"10.1007","author":[{"given":"Jaros\u0142aw","family":"Rudy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,12]]},"reference":[{"key":"43_CR1","doi-asserted-by":"publisher","unstructured":"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\u2013301 (2018). \n                  https:\/\/doi.org\/10.1109\/ICSTW.2018.00063","DOI":"10.1109\/ICSTW.2018.00063"},{"key":"43_CR2","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/978-3-642-01970-8_62","volume-title":"Computational Science - ICCS 2009","author":"W Bo\u017cejko","year":"2009","unstructured":"Bo\u017cejko, 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\u2013640. Springer, Heidelberg (2009)"},{"issue":"6","key":"43_CR3","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1080\/00207540310001631584","volume":"42","author":"G Centeno","year":"2004","unstructured":"Centeno, G., Armacost, R.L.: Minimizing makespan on parallel machines with release time and machine eligibility restrictions. Int. J. Prod. Res. 42(6), 1243\u20131256 (2004). \n                  https:\/\/doi.org\/10.1080\/00207540310001631584","journal-title":"Int. J. Prod. Res."},{"issue":"7","key":"43_CR4","doi-asserted-by":"publisher","first-page":"3161","DOI":"10.1016\/j.apm.2011.09.061","volume":"36","author":"B Cheng","year":"2012","unstructured":"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\u20133167 (2012). \n                  https:\/\/doi.org\/10.1016\/j.apm.2011.09.061","journal-title":"Appl. Math. Modell."},{"issue":"3","key":"43_CR5","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"MR Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: \u201cStrong\u201d NP-completeness results: motivation, examples, and implications. J. ACM 25(3), 499\u2013508 (1978). \n                  https:\/\/doi.org\/10.1145\/322077.322090","journal-title":"J. ACM"},{"issue":"2","key":"43_CR6","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17(2), 416\u2013429 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"43_CR7","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.procs.2016.03.003","volume":"79","author":"D Kumar","year":"2016","unstructured":"Kumar, D., Mishra, K.: The impacts of test automation on software\u2019s cost, quality and time to market. Procedia Comput. Sci. 79, 8\u201315 (2016). \n                  https:\/\/doi.org\/10.1016\/j.procs.2016.03.003","journal-title":"Procedia Comput. Sci."},{"key":"43_CR8","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-319-91446-6_31","volume-title":"Contemporary Complex Systems and Their Dependability","author":"P Lampe","year":"2019","unstructured":"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\u2013337. Springer International Publishing, Cham (2019)"},{"issue":"10","key":"43_CR9","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.infsof.2004.11.006","volume":"47","author":"A Lastovetsky","year":"2005","unstructured":"Lastovetsky, A.: Parallel testing of distributed software. Inf. Softw. Technol. 47(10), 657\u2013662 (2005). \n                  https:\/\/doi.org\/10.1016\/j.infsof.2004.11.006","journal-title":"Inf. Softw. Technol."},{"issue":"3","key":"43_CR10","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1002\/nav.21744","volume":"64","author":"H Su","year":"2017","unstructured":"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\u2013267 (2017). \n                  https:\/\/doi.org\/10.1002\/nav.21744","journal-title":"Naval Res. Logistics (NRL)"},{"issue":"2","key":"43_CR11","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1016\/j.eswa.2009.06.070","volume":"37","author":"HM Wang","year":"2010","unstructured":"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\u20131521 (2010). \n                  https:\/\/doi.org\/10.1016\/j.eswa.2009.06.070","journal-title":"Expert Syst. Appl."},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.cor.2018.07.025","volume":"100","author":"C Yu","year":"2018","unstructured":"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\u2013229 (2018). \n                  https:\/\/doi.org\/10.1016\/j.cor.2018.07.025\n                  \n                . \n                  http:\/\/www.sciencedirect.com\/science\/article\/pii\/S030505481830217X","journal-title":"Comput. Oper. Res."},{"key":"43_CR13","doi-asserted-by":"publisher","unstructured":"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\u2013188. IEEE Computer Society, Washington, DC (2010). \n                  https:\/\/doi.org\/10.1109\/SOSE.2010.36","DOI":"10.1109\/SOSE.2010.36"},{"key":"43_CR14","doi-asserted-by":"publisher","unstructured":"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\u2013578 (2015). \n                  https:\/\/doi.org\/10.2991\/isci-15.2015.76","DOI":"10.2991\/isci-15.2015.76"}],"container-title":["Advances in Intelligent Systems and Computing","Engineering in Dependability of Computer Systems and Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19501-4_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T03:45:57Z","timestamp":1558151157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19501-4_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,12]]},"ISBN":["9783030195007","9783030195014"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19501-4_43","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,5,12]]},"assertion":[{"value":"12 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DepCoS-RELCOMEX","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Dependability and Complex Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brun\u00f3w","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"depcos2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/depcos.pwr.wroc.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}