{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:33:37Z","timestamp":1740123217235,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["CZ.02.1.01\/0.0\/0.0\/15_003\/0000466"],"award-info":[{"award-number":["CZ.02.1.01\/0.0\/0.0\/15_003\/0000466"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004578","name":"Ministerstvo Prumyslu a Obchodu","doi-asserted-by":"publisher","award":["CZ.01.1.02\/0.0\/0.0\/20 321\/0024399"],"award-info":[{"award-number":["CZ.01.1.02\/0.0\/0.0\/20 321\/0024399"]}],"id":[{"id":"10.13039\/501100004578","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s10479-021-04445-x","type":"journal-article","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T05:27:43Z","timestamp":1641014863000},"page":"209-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing the execution probability of jobs with replication in mixed-criticality schedules"],"prefix":"10.1007","volume":"309","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2203-4554","authenticated-orcid":false,"given":"Antonin","family":"Novak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zdenek","family":"Hanzalek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"4445_CR1","doi-asserted-by":"publisher","unstructured":"Agirre, I., Cazorla, F. J., Abella, J., Hernandez, C., Mezzetti, E., Azkarate-askatsua, M., & Vardanega, T. (2018). Fitting software execution-time exceedance into a residual random fault in ISO-26262. IEEE Transactions on Reliability 67(3), 1314\u20131327 https:\/\/doi.org\/10.1109\/TR.2018.2828222.","DOI":"10.1109\/TR.2018.2828222"},{"key":"4445_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-319-95246-8_5","volume-title":"Predictability issues in mixed-criticality real-time systems","author":"S Baruah","year":"2018","unstructured":"Baruah, S. (2018). Predictability issues in mixed-criticality real-time systems (pp. 77\u201387). Cham: Springer. https:\/\/doi.org\/10.1007\/978-3-319-95246-8_5."},{"key":"4445_CR3","doi-asserted-by":"crossref","unstructured":"Baruah, S., Bonifaci, V., D\u2019angelo, G., Li, H., Marchetti-Spaccamela, A., Van Der Ster, S., & Stougie, L., (2015). Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems. Journal of the ACM (JACM) 62(2), 14.","DOI":"10.1145\/2699435"},{"key":"4445_CR4","doi-asserted-by":"crossref","unstructured":"Baruah, S., Fohler, G., (2011). Certification-cognizant time-triggered scheduling of mixed-criticality systems. In 2011 IEEE 32nd real-time systems symposium (RTSS), (pp. 3\u201312). IEEE.","DOI":"10.1109\/RTSS.2011.9"},{"key":"4445_CR5","doi-asserted-by":"crossref","unstructured":"Behera, L., & Bhaduri, P. (2018). Time-triggered scheduling for multiprocessor mixed-criticality systems. In Distributed computing and internet technology (pp. 135\u2013151). Springer International Publishing, Cham.","DOI":"10.1007\/978-3-319-72344-0_10"},{"key":"4445_CR6","unstructured":"Bell, R. (2006). Introduction to IEC 61508. In Proceedings of the 10th Australian workshop on Safety critical systems and software (Vol. 55, pp. 3\u201312). Australian Computer Society, Inc."},{"key":"4445_CR7","volume-title":"Handbook on scheduling: From theory to applications","author":"J Blazewicz","year":"2007","unstructured":"Blazewicz, J., Ecker, K. H., Pesch, E., Schmidt, G., & Weglarz, J. (2007). Handbook on scheduling: From theory to applications. New York: Springer."},{"key":"4445_CR8","doi-asserted-by":"publisher","unstructured":"Burns, A., Davis, R.I. (2017). A survey of research into mixed criticality systems. ACM Computing Surveys 50(6), 82:1\u201382:37 https:\/\/doi.org\/10.1145\/3131347.","DOI":"10.1145\/3131347"},{"issue":"10","key":"4445_CR9","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.1109\/TC.2018.2831227","volume":"67","author":"A Burns","year":"2018","unstructured":"Burns, A., Davis, R. I., Baruah, S., & Bate, I. (2018). Robust mixed-criticality systems. IEEE Transactions on Computers, 67(10), 1478\u20131491.","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"4445_CR10","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1016\/j.ejor.2018.07.007","volume":"272","author":"Z Chang","year":"2019","unstructured":"Chang, Z., Ding, J. Y., & Song, S. (2019). Distributionally robust scheduling on parallel machines under moment uncertainty. European Journal of Operational Research, 272(3), 832\u2013846. https:\/\/doi.org\/10.1016\/j.ejor.2018.07.007.","journal-title":"European Journal of Operational Research"},{"key":"4445_CR11","unstructured":"Creignou, N., & Hermann, M. (1993). On P completeness of some counting problems. Ph.D. thesis, INRIA"},{"key":"4445_CR12","doi-asserted-by":"crossref","unstructured":"Dagum, P., & Luby, M. (1997). An optimal approximation algorithm for Bayesian inference. Artificial Intelligence 93(1\u20132), 1\u201327","DOI":"10.1016\/S0004-3702(97)00013-1"},{"key":"4445_CR13","doi-asserted-by":"crossref","unstructured":"Daniels, R.L., & Carrillo, J.E. (1997). $$\\beta $$-robust scheduling for single-machine systems with uncertain processing times. IIE Transactions 29(11), 977\u2013985","DOI":"10.1080\/07408179708966416"},{"key":"4445_CR14","doi-asserted-by":"publisher","unstructured":"Davis, R.I., Altmeyer, S., & Burns, A. (2018). Mixed criticality systems with varying context switch costs. In 2018 IEEE real-time and embedded technology and applications symposium (RTAS) (pp. 140\u2013151). https:\/\/doi.org\/10.1109\/RTAS.2018.00024.","DOI":"10.1109\/RTAS.2018.00024"},{"key":"4445_CR15","unstructured":"Draskovic, S., Huang, P., & Thiele, L. (2016). On the safety of mixed-criticality scheduling. In Proceedings of the 4th international workshop on mixed criticality systems, RTSS (pp. 19 \u2013 24). IEEE, Porto, Portugal"},{"key":"4445_CR16","first-page":"1","volume":"26","author":"R El-Hajj","year":"2020","unstructured":"El-Hajj, R., Guibadj, R. N., Moukrim, A., & Serairi, M. (2020). A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit. Annals of Operations Research, 26, 1\u201336.","journal-title":"Annals of Operations Research"},{"key":"4445_CR17","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"4445_CR18","unstructured":"Guo, H., & Hsu, W. (2002). A survey of algorithms for real-time Bayesian network inference. In Join workshop on real time decision support and diagnosis systems."},{"key":"4445_CR19","doi-asserted-by":"crossref","unstructured":"Hamaz, I., Houssin, L., & Cafieri, S. (2018). A branch-and-bound procedure for the robust cyclic job shop problem. In International symposium on combinatorial optimization (pp. 228\u2013240). Springer.","DOI":"10.1007\/978-3-319-96151-4_20"},{"issue":"1\u20132","key":"4445_CR20","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10479-016-2184-6","volume":"248","author":"Z Hanzalek","year":"2017","unstructured":"Hanzalek, Z., & Sucha, P. (2017). Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources. Annals of Operations Research, 248(1\u20132), 209\u2013237.","journal-title":"Annals of Operations Research"},{"issue":"5","key":"4445_CR21","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s10951-016-0468-y","volume":"19","author":"Z Hanzalek","year":"2016","unstructured":"Hanzalek, Z., Tunys, T., & Sucha, P. (2016). An analysis of the non-preemptive mixed-criticality match-up scheduling problem. Journal of Scheduling, 19(5), 601\u2013607. https:\/\/doi.org\/10.1007\/s10951-016-0468-y.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"4445_CR22","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.ejor.2004.04.002","volume":"165","author":"W Herroelen","year":"2005","unstructured":"Herroelen, W., & Leus, R. (2005). Project scheduling under uncertainty: Survey and research potentials. European Journal of Operational Research, 165(2), 289\u2013306. https:\/\/doi.org\/10.1016\/j.ejor.2004.04.002.","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"4445_CR23","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1109\/71.722221","volume":"9","author":"I Ahmad","year":"1998","unstructured":"Ahmad, I., & Kwok, Y.-K. (1998). On exploiting task duplication in parallel program scheduling. IEEE Transactions on Parallel and Distributed Systems, 9(9), 872\u2013892. https:\/\/doi.org\/10.1109\/71.722221.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"4445_CR24","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10479-019-03298-9","volume":"285","author":"F Jaramillo","year":"2020","unstructured":"Jaramillo, F., Keles, B., & Erkoc, M. (2020). Modeling single machine preemptive scheduling problems for computational efficiency. Annals of Operations Research, 285(1), 197\u2013222.","journal-title":"Annals of Operations Research"},{"key":"4445_CR25","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/BFb0024530","volume-title":"Event-triggered versus time-triggered real-time systems","author":"H Kopetz","year":"1991","unstructured":"Kopetz, H. (1991). Event-triggered versus time-triggered real-time systems (pp. 86\u2013101). Berlin: Springer. https:\/\/doi.org\/10.1007\/BFb0024530."},{"key":"4445_CR26","unstructured":"Kwisthout, J., Bodlaender, H. L., & van\u00a0der Gaag, L. C. (2010). The necessity of bounded treewidth for efficient inference in Bayesian networks. In ECAI (vol. 215, pp. 237\u2013242)."},{"key":"4445_CR27","first-page":"1","volume":"2","author":"YF Li","year":"2019","unstructured":"Li, Y. F., Huang, H. Z., Mi, J., Peng, W., & Han, X. (2019). Reliability analysis of multi-state systems with common cause failures based on Bayesian network and fuzzy probability. Annals of Operations Research, 2, 1\u201315.","journal-title":"Annals of Operations Research"},{"key":"4445_CR28","unstructured":"Murphy, K. P., Weiss, Y., & Jordan, M. I. (1999). Loopy belief propagation for approximate inference: An empirical study. In Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence (pp. 467\u2013475). Morgan Kaufmann Publishers Inc."},{"issue":"3","key":"4445_CR29","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/j.ejor.2019.05.038","volume":"279","author":"A Novak","year":"2019","unstructured":"Novak, A., Sucha, P., & Hanzalek, Z. (2019). Scheduling with uncertain processing times in mixed-criticality systems. European Journal of Operational Research, 279(3), 687\u2013703. https:\/\/doi.org\/10.1016\/j.ejor.2019.05.038.","journal-title":"European Journal of Operational Research"},{"key":"4445_CR30","doi-asserted-by":"crossref","unstructured":"Obermaisser, R., Kopetz, H., El\u00a0Salloum, C., & Huber, B. (2007). Error containment in the time-triggered system-on-a-chip architecture. In Embedded system design: Topics, techniques and trends (pp. 339\u2013352). Springer.","DOI":"10.1007\/978-0-387-72258-0_29"},{"issue":"2","key":"4445_CR31","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1137\/0219021","volume":"19","author":"CH Papadimitriou","year":"1990","unstructured":"Papadimitriou, C. H., & Yannakakis, M. (1990). Towards an architecture-independent analysis of parallel algorithms. SIAM Journal on Computing, 19(2), 322\u2013328.","journal-title":"SIAM Journal on Computing"},{"key":"4445_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2019.04.025","volume":"191","author":"R Paredes","year":"2019","unstructured":"Paredes, R., Due\u00f1as-Osorio, L., Meel, K., & Vardi, M. (2019). Principled network reliability approximation: A counting-based approach. Reliability Engineering & System Safety, 191, 106472. https:\/\/doi.org\/10.1016\/j.ress.2019.04.025.","journal-title":"Reliability Engineering & System Safety"},{"issue":"7","key":"4445_CR33","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1016\/j.cor.2011.09.019","volume":"39","author":"M Ranjbar","year":"2012","unstructured":"Ranjbar, M., Davari, M., & Leus, R. (2012). Two branch-and-bound algorithms for the robust parallel machine scheduling problem. Computers & Operations Research, 39(7), 1652\u20131660. https:\/\/doi.org\/10.1016\/j.cor.2011.09.019.","journal-title":"Computers & Operations Research"},{"key":"4445_CR34","unstructured":"Russell, S.J., & Norvig, P. (2016). Artificial intelligence: A modern approach. Pearson Education Limited:Malaysia."},{"key":"4445_CR35","unstructured":"Sang, T., Bearne, P., & Kautz, H. (2005). Performing bayesian inference by weighted model counting. In Proceedings of the 20th national conference on artificial intelligence (Vol. 1, pp. 475\u2013481), AAAI\u201905. AAAI Press http:\/\/dl.acm.org\/citation.cfm?id=1619332.1619409."},{"key":"4445_CR36","doi-asserted-by":"crossref","unstructured":"Santiv\u00e1\u00f1ez, J.A., & Melachrinoudis, E. (2020). Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions. Annals of Operations Research 286(1), 669\u2013701","DOI":"10.1007\/s10479-018-2993-x"},{"issue":"1","key":"4445_CR37","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.ejor.2017.03.054","volume":"262","author":"Y Seddik","year":"2017","unstructured":"Seddik, Y., & Hanzalek, Z. (2017). Match-up scheduling of mixed-criticality jobs: Maximizing the probability of jobs execution. European Journal of Operational Research, 262(1), 46\u201359. https:\/\/doi.org\/10.1016\/j.ejor.2017.03.054.","journal-title":"European Journal of Operational Research"},{"key":"4445_CR38","unstructured":"Theis, J., Fohler, G., & Baruah, S. (2013). Schedule table generation for time-triggered mixed criticality systems. In Proceedings of the 1st international workshop on mixed criticality systems (pp. 79\u201384), RTSS ."},{"issue":"2","key":"4445_CR39","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L Valiant","year":"1979","unstructured":"Valiant, L. (1979). The complexity of computing the permanent. Theoretical Computer Science, 8(2), 189\u2013201. https:\/\/doi.org\/10.1016\/0304-3975(79)90044-6.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"4445_CR40","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L Valiant","year":"1979","unstructured":"Valiant, L. (1979). The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3), 410\u2013421. https:\/\/doi.org\/10.1137\/0208032.","journal-title":"SIAM Journal on Computing"},{"key":"4445_CR41","doi-asserted-by":"crossref","unstructured":"Vestal, S. (2007). Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In 28th IEEE international real-time systems symposium (pp. 239\u2013243), RTSS 2007. IEEE.","DOI":"10.1109\/RTSS.2007.47"},{"issue":"1","key":"4445_CR42","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s10479-019-03405-w","volume":"287","author":"CT Yeh","year":"2020","unstructured":"Yeh, C. T. (2020). Binary-state line assignment optimization to maximize the reliability of an information network under time and budget constraints. Annals of Operations Research, 287(1), 439\u2013463.","journal-title":"Annals of Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04445-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-021-04445-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04445-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T16:35:14Z","timestamp":1642437314000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-021-04445-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,1]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["4445"],"URL":"https:\/\/doi.org\/10.1007\/s10479-021-04445-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2022,1,1]]},"assertion":[{"value":"15 November 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}