{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T16:38:54Z","timestamp":1781714334609,"version":"3.54.5"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030648428","type":"print"},{"value":"9783030648435","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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-64843-5_8","type":"book-chapter","created":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T16:04:24Z","timestamp":1607097864000},"page":"107-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Complexity of a Periodic Scheduling Problem with Precedence Relations"],"prefix":"10.1007","author":[{"given":"Richard","family":"Hlad\u00edk","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anna","family":"Minaeva","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zden\u011bk","family":"Hanz\u00e1lek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,12,4]]},"reference":[{"issue":"3","key":"8_CR1","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1287\/moor.27.3.518.314","volume":"27","author":"A Bar-Noy","year":"2002","unstructured":"Bar-Noy, A., Bhatia, R., Naor, J.S., Schieber, B.: Minimizing service and operation costs of periodic scheduling. Math. Oper. Res. 27(3), 518\u2013544 (2002)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0377-2217(99)00486-5","volume":"127","author":"J B\u0142a\u017cewicz","year":"2000","unstructured":"B\u0142a\u017cewicz, J., Pesch, E., Sterna, M.: The disjunctive graph machine representation of the job shop scheduling problem. Eur. J. Oper. Res. 127(2), 317\u2013331 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/BF01940882","volume":"15","author":"Y Cai","year":"1996","unstructured":"Cai, Y., Kong, M.: Nonpreemptive scheduling of periodic tasks in uni-and multiprocessor systems. Algorithmica 15, 572\u2013599 (1996)","journal-title":"Algorithmica"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Dvorak, J., Hanzalek, Z.: Multi-variant time constrained FlexRay static segment scheduling. In: 2014 10th IEEE Workshop on Factory Communication Systems (WFCS 2014), pp. 1\u20138 (2014)","DOI":"10.1109\/WFCS.2014.6837576"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1109\/TVT.2018.2879920","volume":"68","author":"J Dvo\u0159\u00e1k","year":"2018","unstructured":"Dvo\u0159\u00e1k, J., Hanz\u00e1lek, Z.: Multi-variant scheduling of critical time-triggered communication in incremental development process: application to flexray. IEEE Trans. Veh. Technol. 68(1), 155\u2013169 (2018)","journal-title":"IEEE Trans. Veh. Technol."},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-14165-2_26","volume-title":"Automata, Languages and Programming","author":"F Eisenbrand","year":"2010","unstructured":"Eisenbrand, F., H\u00e4hnle, N., Niemeier, M., Skutella, M., Verschae, J., Wiese, A.: Scheduling periodic tasks in a hard real-time environment. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 299\u2013311. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14165-2_26"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-15775-2_2","volume-title":"Algorithms \u2013 ESA 2010","author":"F Eisenbrand","year":"2010","unstructured":"Eisenbrand, F., et al.: Solving an avionics real-time scheduling problem by advanced IP-methods. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6346, pp. 11\u201322. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15775-2_2"},{"key":"8_CR8","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.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discret. Math."},{"key":"8_CR9","unstructured":"Jacobs, T., Longo, S.: A new perspective on the windows scheduling problem. arXiv preprint arXiv:1410.7237 (2014)"},{"key":"8_CR10","unstructured":"Jeffay, K., Stanat, D.F., Martel, C.U.: On non-preemptive scheduling of periodic and sporadic tasks. In: IEEE Real-time Systems Symposium, pp. 129\u2013139. IEEE, USA (1991)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-662-25209-3_12","volume-title":"Parle 1991 Parallel Architectures and Languages Europe","author":"J Korst","year":"1991","unstructured":"Korst, J., Aarts, E., Lenstra, J.K., Wessels, J.: Periodic multiprocessor scheduling. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds.) Parle 1991 Parallel Architectures and Languages Europe. LNCS, pp. 166\u2013178. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/978-3-662-25209-3_12"},{"issue":"4","key":"8_CR12","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1287\/ijoc.8.4.428","volume":"8","author":"J Korst","year":"1996","unstructured":"Korst, J., Aarts, E., Lenstra, J.K.: Scheduling periodic tasks. INFORMS J. Comput. 8(4), 428\u2013435 (1996)","journal-title":"INFORMS J. Comput."},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Lenstra, J.K., Kan, A.R.: Computational complexity of discrete optimization problems. In: Annals of Discrete Mathematics, vol. 4, pp. 121\u2013140. Elsevier (1979)","DOI":"10.1016\/S0167-5060(08)70821-5"},{"issue":"4","key":"8_CR14","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0020-0190(98)00221-X","volume":"65","author":"JR Nawrocki","year":"1998","unstructured":"Nawrocki, J.R., Czajka, A., Complak, W.: Scheduling cyclic tasks with binary periods. Inf. Process. Lett. 65(4), 173\u2013178 (1998)","journal-title":"Inf. Process. Lett."},{"key":"8_CR15","volume-title":"Discrete-Time Control Systems","author":"K Ogata","year":"1995","unstructured":"Ogata, K.: Discrete-Time Control Systems, vol. 2. Prentice Hall, Englewood Cliffs (1995)"},{"key":"8_CR16","unstructured":"Oliver, R.S., Craciunas, S.S., Steiner, W.: IEEE 802.1 Qbv gate control list synthesis using array theory encoding. In: 2018 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), pp. 13\u201324. IEEE (2018)"},{"issue":"2","key":"8_CR17","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0167-6377(83)90044-5","volume":"2","author":"W Wei","year":"1983","unstructured":"Wei, W., Liu, C.: On a periodic maintenance problem. Oper. Res. Lett. 2(2), 90\u201393 (1983)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64843-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T16:48:11Z","timestamp":1607100491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64843-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030648428","9783030648435"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64843-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"104","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}