{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:36:39Z","timestamp":1770921399326,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032178008","type":"print"},{"value":"9783032178015","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-17801-5_49","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:08Z","timestamp":1770918788000},"page":"678-692","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Buffer Minimization Problem for\u00a0Scheduling Flow Jobs with\u00a0Conflicts"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-7085-8699","authenticated-orcid":false,"given":"Niklas","family":"Haas","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6117-1343","authenticated-orcid":false,"given":"S\u00f6ren","family":"Schmitt","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3664-0865","authenticated-orcid":false,"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"key":"49_CR1","doi-asserted-by":"publisher","unstructured":"Baker, B.S., Coffman Jr, E.G.: Mutual exclusion scheduling. Theor. Comput. Sci., 162(2), 225\u2013243 (1996). https:\/\/doi.org\/10.1016\/0304-3975(96)00031-X","DOI":"10.1016\/0304-3975(96)00031-X"},{"key":"49_CR2","doi-asserted-by":"publisher","unstructured":"Bodlaender, H.L., Jansen, K.: On the complexity of scheduling incompatible jobs with unit-times. In: Borzyszkowski, A.M., Sokolowski, S., eds., Mathematical Foundations of Computer Science 1993, 18th International Symposium, MFCS\u201993, Gdansk, Poland, August 30 - September 3, 1993, Proceedings, volume 711 of Lecture Notes in Computer Science, pp. 291\u2013300. Springer (1993). https:\/\/doi.org\/10.1007\/3-540-57182-5_21","DOI":"10.1007\/3-540-57182-5_21"},{"key":"49_CR3","doi-asserted-by":"publisher","unstructured":"Bodlaender, H.L., Jansen, K.: Restrictions of graph partition problems. part I. Theor. Comput. Sci., 148(1), 93\u2013109 (1995). https:\/\/doi.org\/10.1016\/0304-3975(95)00057-4","DOI":"10.1016\/0304-3975(95)00057-4"},{"key":"49_CR4","doi-asserted-by":"publisher","unstructured":"Bodlaender, H.L., Jansen, K., Woeginger, G.J.: Scheduling with incompatible jobs. Discret. Appl. Math., 55(3), 219\u2013232 (1994). https:\/\/doi.org\/10.1016\/0166-218X(94)90009-4","DOI":"10.1016\/0166-218X(94)90009-4"},{"key":"49_CR5","doi-asserted-by":"publisher","unstructured":"Buchem, M., Kleist, L., Waldschmidt, D.S.G.: Scheduling with machine conflicts. In: Chalermsook, P., Laekhanukit, B., eds., Approximation and Online Algorithms - 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, Proceedings, volume 13538 of Lecture Notes in Computer Science, pp. 36\u201360. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-18367-6_3","DOI":"10.1007\/978-3-031-18367-6_3"},{"key":"49_CR6","unstructured":"Chrobak, M.: Personal communication."},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"Chrobak, M., et al.: The buffer minimization problem for multiprocessor scheduling with conflicts. In: Orejas, F., Spirakis, P.G., Leeuwen, J., eds., Automata, Languages and Programming, pp. 862\u2013874, Berlin, Heidelberg (2001). Springer Berlin Heidelberg","DOI":"10.1007\/3-540-48224-5_70"},{"key":"49_CR8","doi-asserted-by":"publisher","unstructured":"D\u2019osa, G., Epstein, L.: Online scheduling with a buffer on related machines. J. Comb. Optim., 20(2), 161\u2013179 (2010). https:\/\/doi.org\/10.1007\/S10878-008-9200-Y.","DOI":"10.1007\/S10878-008-9200-Y."},{"key":"49_CR9","doi-asserted-by":"publisher","unstructured":"Even, G., Halld\u2019orsson, M.M., Kaplan, L., Ron, D.: Scheduling with conflicts: online and offline algorithms. J. Sched., 12(2), 199\u2013224 (2009). https:\/\/doi.org\/10.1007\/S10951-008-0089-1","DOI":"10.1007\/S10951-008-0089-1"},{"key":"49_CR10","unstructured":"Haas, N., Schmitt, S., Stee, R.: The buffer minimization problem for scheduling flow jobs with conflicts (2025). https:\/\/arxiv.org\/abs\/2511. 19690, arXiv:2511.19690"},{"key":"49_CR11","doi-asserted-by":"publisher","unstructured":"H\u00f6hne, F., Stee, R.: Buffer minimization with conflicts on a line. Theor. Comput. Sci., 876, 25\u201333 (2021). https:\/\/doi.org\/10.1016\/J.TCS.2021.05.013","DOI":"10.1016\/J.TCS.2021.05.013"},{"key":"49_CR12","doi-asserted-by":"publisher","unstructured":"Hong, H.-C., Lin, B.M.T.: Parallel dedicated machine scheduling with conflict graphs. Comput. Ind. Eng., 124, 316\u2013321 (2018). https:\/\/doi.org\/10.1016\/J.CIE.2018.07.035","DOI":"10.1016\/J.CIE.2018.07.035"},{"key":"49_CR13","unstructured":"Irani, S., Leung, V.J.: Scheduling with conflicts, and applications to traffic signal control. In: Tardos, E., eds., Proceedings of the Seventh Annual ACMSIAM Symposium on Discrete Algorithms, 28-30 January 1996, Atlanta, Georgia, USA, pp. 85\u201394. ACM\/SIAM 1(996). http:\/\/dl.acm.org\/citation.cfm? id=313852.313892"},{"key":"49_CR14","doi-asserted-by":"publisher","unstructured":"Kowalczyk, D., Leus, R.: An exact algorithm for parallel machine scheduling with conflicts. J. Sched., 20(4), 355\u2013372 (2017). https:\/\/doi.org\/10.1007\/S10951-016-0482-0","DOI":"10.1007\/S10951-016-0482-0"},{"key":"49_CR15","doi-asserted-by":"publisher","unstructured":"Mallek, A., Bendraouche, M., Boudhar, M.: Scheduling identical jobs on uniform machines with a conflict graph. Comput. Oper. Res., 111, 357\u2013 366 (2019). https:\/\/doi.org\/10.1016\/J.COR.2019.07.011","DOI":"10.1016\/J.COR.2019.07.011"},{"key":"49_CR16","doi-asserted-by":"publisher","unstructured":"Mallek, A., Boudhar, M.: A branch-and-bound algorithm for the problem of scheduling with a conflict graph. In: 2020 International Conference on Decision Aid Sciences and Application (DASA), pp. 778\u2013782 (2020). https:\/\/doi.org\/10.1109\/DASA51403.2020.9317026","DOI":"10.1109\/DASA51403.2020.9317026"},{"key":"49_CR17","doi-asserted-by":"publisher","unstructured":"Mallek, A., Boudhar, M.: Scheduling on uniform machines with a conflict graph: complexity and resolution. Int. Trans. Oper. Res., 31(2), 863\u2013888 (2024). https:\/\/doi.org\/10.1111\/ITOR.13170","DOI":"10.1111\/ITOR.13170"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2026: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17801-5_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:10Z","timestamp":1770918790000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of interests"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem.uj.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}