{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:29:56Z","timestamp":1759847396717},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T00:00:00Z","timestamp":1457308800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10951-016-0468-y","type":"journal-article","created":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T09:41:36Z","timestamp":1457343696000},"page":"601-607","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/http\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["An analysis of the non-preemptive mixed-criticality match-up scheduling problem"],"prefix":"10.1007","volume":"19","author":[{"given":"Zden\u011bk","family":"Hanz\u00e1lek","sequence":"first","affiliation":[]},{"given":"Tom\u00e1\u0161","family":"Tunys","sequence":"additional","affiliation":[]},{"given":"P\u0159emysl","family":"\u0160\u016fcha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,7]]},"reference":[{"issue":"1","key":"468_CR1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10951-009-0111-2","volume":"13","author":"MS Akt\u00fcrk","year":"2010","unstructured":"Akt\u00fcrk, M. S., Atamt\u00fcrk, A., & G\u00fcrel, S. (2010). Parallel machine match-up scheduling with manufacturing cost considerations. Journal of Scheduling, 13(1), 95\u2013110.","journal-title":"Journal of Scheduling"},{"key":"468_CR2","unstructured":"Barhorst, J., Belote, T., Binns, P., Hoffman, J., Paunicka, J., Sarathy, P., Stanfill, J., Stuart, D., & Urzi, R. (2009). A research agenda for mixed-criticality systems. In 15th IEEE real-time and embedded technology and applications symposium."},{"issue":"8","key":"468_CR3","doi-asserted-by":"crossref","first-page":"1140","DOI":"10.1109\/TC.2011.142","volume":"61","author":"S Baruah","year":"2012","unstructured":"Baruah, S., Bonifaci, V., D\u2019Angelo, G., Li, H., Marchetti-Spaccamela, A., Megow, N., et al. (2012). Scheduling real-time mixed-criticality jobs. IEEE Transactions on Computers, 61(8), 1140\u20131152.","journal-title":"IEEE Transactions on Computers"},{"key":"468_CR4","doi-asserted-by":"crossref","unstructured":"Baruah, S., & Fohler, G. (2011). Certification-cognizant time-triggered scheduling of mixed-criticality systems. In: Real-time systems symposium 2011 (pp. 3\u201312). IEEE Computer Society.","DOI":"10.1109\/RTSS.2011.9"},{"key":"468_CR5","unstructured":"Baruah, S., Li, H., & Stougie, L. (2010). Towards the design of certifiable mixed-criticality systems. Real-time and embedded technology and applications symposium, RTAS (pp. 13\u201322). Washington, DC: IEEE Computer Society."},{"key":"468_CR6","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., & Nemirovski, A. (2009). Robust optimization. Princeton: Princeton University Press."},{"issue":"3","key":"468_CR7","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, D., & Caramanis, C. (2011). Theory and applications of robust optimization. SIAM Review, 53(3), 464\u2013501.","journal-title":"SIAM Review"},{"key":"468_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04363-9","volume-title":"Scheduling computer and manufacturing processes","author":"J B\u0142azewicz","year":"2001","unstructured":"B\u0142azewicz, J., Ecker, K., Schmidt, G., & W\u0229glarz, J. (2001). Scheduling computer and manufacturing processes (2nd ed.). Berlin: Springer.","edition":"2"},{"issue":"3","key":"468_CR9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10951-007-0010-3","volume":"10","author":"C Briand","year":"2007","unstructured":"Briand, C., La, H., & Erschler, J. (2007). A robust approach for the single machine scheduling problem. Journal of Scheduling, 10(3), 209\u2013221.","journal-title":"Journal of Scheduling"},{"key":"468_CR10","unstructured":"Burns, A., & Davis, R. (2013). Mixed criticality systems\u2014a review. https:\/\/linproxy.fan.workers.dev:443\/http\/www-users.cs.york.ac.uk\/~burns\/review.pdf . Department of Computer Science, University of York."},{"issue":"2","key":"468_CR11","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s10951-013-0321-5","volume":"17","author":"S Fung","year":"2014","unstructured":"Fung, S. (2014). Online scheduling with preemption or non-completion penalties. Journal of Scheduling, 17(2), 173\u2013183.","journal-title":"Journal of Scheduling"},{"key":"468_CR12","unstructured":"Hanzalek, Z., & Pacha, T. (1998). Use of the fieldbus systems in academic setting. In: Proceedings on real-time systems education III (pp. 93\u201397)."},{"key":"468_CR13","unstructured":"Lemke, M., Konstantellos, A., Riemenschneider, R., Steinhoegl, W., Tsarchopaulos, P., & Cotta, J. (2012). Workshop on mixed criticality systems, Brussels."},{"key":"468_CR14","doi-asserted-by":"crossref","unstructured":"Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343\u2013362.","DOI":"10.1016\/S0167-5060(08)70743-X"},{"key":"468_CR15","doi-asserted-by":"crossref","unstructured":"Nelson, A., Goossens, K., & Akesson, B. Dataflow formalisation of real-time streaming applications on a composable and predictable multi-processor SOC. Journal of Systems Architecture (in press).","DOI":"10.1016\/j.sysarc.2015.04.001"},{"issue":"1","key":"468_CR16","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","volume":"16","author":"D Shabtay","year":"2013","unstructured":"Shabtay, D., Gaspar, N., & Kaspi, M. (2013). A survey on offline scheduling with rejection. Journal of Scheduling, 16(1), 3\u201328.","journal-title":"Journal of Scheduling"},{"issue":"13","key":"468_CR17","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D Shabtay","year":"2007","unstructured":"Shabtay, D., & Steiner, G. (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155(13), 1643\u20131666.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"468_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.09.042","volume":"212","author":"SA Slotnick","year":"2011","unstructured":"Slotnick, S. A. (2011). Order acceptance and scheduling: A taxonomy and review. European Journal of Operational Research, 212(1), 1\u201311.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"468_CR19","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/j.sysarc.2011.02.005","volume":"57","author":"M Sojka","year":"2011","unstructured":"Sojka, M., Pisa, P., Faggioli, D., Cucinotta, T., Checconi, F., Hanzalek, Z., et al. (2011). Modular software architecture for flexible reservation mechanisms on heterogeneous resources. Journal of Systems Architecture, 57(4), 366\u2013382.","journal-title":"Journal of Systems Architecture"},{"issue":"5","key":"468_CR20","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"AL Soyster","year":"1973","unstructured":"Soyster, A. L. (1973). Technical note on convex programming with set-inclusive constraints and applications to inexact linear programming. Operations Research, 21(5), 1154\u20131157.","journal-title":"Operations Research"},{"key":"468_CR21","unstructured":"Theis, J., & Fohler, G. (2013). Mixed criticality scheduling in time-triggered legacy systems. In: 1st workshop on mixed criticality systems, IEEE real-time systems symposium."},{"key":"468_CR22","unstructured":"Theis, J., Fohler, G., & Baruah, S. (2013). Schedule table generation for time-triggered mixed criticality systems. In: 1st workshop on mixed criticality systems, IEEE real-time systems symposium."},{"key":"468_CR23","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10951-014-0395-8","volume":"18","author":"S Thevenin","year":"2014","unstructured":"Thevenin, S., Zufferey, N., & Widmer, M. (2014). Metaheuristics for a scheduling problem with rejection and tardiness penalties. Journal of Scheduling, 18, 89\u2013105.","journal-title":"Journal of Scheduling"},{"key":"468_CR24","doi-asserted-by":"crossref","unstructured":"Vestal, S. (2007). Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In: Real-time systems symposium, RTSS (pp. 239\u2013243).","DOI":"10.1109\/RTSS.2007.47"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0468-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/article\/10.1007\/s10951-016-0468-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0468-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0468-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:52Z","timestamp":1559468392000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/10.1007\/s10951-016-0468-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,7]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["468"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/s10951-016-0468-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,7]]}}}