[{"language":[{"iso":"eng"}],"date_updated":"2023-01-30T09:20:09Z","doi":"10.1016/j.tcs.2022.10.031","department":[{"_id":"63"}],"project":[{"_id":"106","name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme"}],"publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"external_id":{"arxiv":["2010.04424 "]},"title":"Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation","type":"journal_article","year":"2023","citation":{"mla":"Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation.” Theoretical Computer Science, vol. 939, Elsevier BV, 2023, pp. 261–91, doi:10.1016/j.tcs.2022.10.031.","bibtex":"@article{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2023, title={Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation}, volume={939}, DOI={10.1016/j.tcs.2022.10.031}, journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}, year={2023}, pages={261–291} }","apa":"Castenow, J., Harbig, J., Jung, D., Knollmann, T., & Meyer auf der Heide, F. (2023). Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. Theoretical Computer Science, 939, 261–291. https://doi.org/10.1016/j.tcs.2022.10.031","ama":"Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. Theoretical Computer Science. 2023;939:261-291. doi:10.1016/j.tcs.2022.10.031","chicago":"Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation.” Theoretical Computer Science 939 (2023): 261–91. https://doi.org/10.1016/j.tcs.2022.10.031.","ieee":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide, “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation,” Theoretical Computer Science, vol. 939, pp. 261–291, 2023, doi: 10.1016/j.tcs.2022.10.031.","short":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical Computer Science 939 (2023) 261–291."},"page":"261-291","_id":"33947","intvolume":" 939","author":[{"last_name":"Castenow","id":"38705","first_name":"Jannik","full_name":"Castenow, Jannik"},{"id":"47213","last_name":"Harbig","full_name":"Harbig, Jonas","first_name":"Jonas"},{"last_name":"Jung","id":"37827","first_name":"Daniel","full_name":"Jung, Daniel"},{"orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till","first_name":"Till","id":"39241","last_name":"Knollmann"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"publisher":"Elsevier BV","publication":"Theoretical Computer Science","keyword":["General Computer Science","Theoretical Computer Science"],"status":"public","date_created":"2022-10-28T05:11:16Z","volume":939,"article_type":"original","user_id":"38705"},{"external_id":{"arxiv":["2206.07567 "]},"place":"Brussels","title":"A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility ","department":[{"_id":"63"}],"project":[{"name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme","_id":"106"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-265-5"]},"publication_status":"published","editor":[{"last_name":"Hillel","full_name":"Hillel, Eshcar","first_name":"Eshcar"},{"full_name":"Palmieri, Roberto","first_name":"Roberto","last_name":"Palmieri"},{"last_name":"Riviére","first_name":"Etienne","full_name":"Riviére, Etienne"}],"date_updated":"2023-02-15T14:53:12Z","doi":"10.4230/LIPIcs.OPODIS.2022.15","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"user_id":"38705","publication":"Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) ","author":[{"full_name":"Castenow, Jannik","first_name":"Jannik","id":"38705","last_name":"Castenow"},{"id":"47213","last_name":"Harbig","full_name":"Harbig, Jonas","first_name":"Jonas"},{"first_name":"Daniel","full_name":"Jung, Daniel","last_name":"Jung","id":"37827"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"first_name":"Till","orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till","last_name":"Knollmann","id":"39241"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"publisher":"Schloss Dagstuhl – Leibniz Zentrum für Informatik","date_created":"2022-11-04T09:41:30Z","status":"public","volume":253,"conference":{"location":"Brussels","name":"26th International Conference on Principles of Distributed Systems (OPODIS)","start_date":"2022-12-13","end_date":"2022-12-15"},"intvolume":" 253","_id":"34008","page":"15:1–15:25","type":"conference","citation":{"apa":"Castenow, J., Harbig, J., Jung, D., Kling, P., Knollmann, T., & Meyer auf der Heide, F. (2023). A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility . In E. Hillel, R. Palmieri, & E. Riviére (Eds.), Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) (Vol. 253, p. 15:1–15:25). Schloss Dagstuhl – Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2022.15","ama":"Castenow J, Harbig J, Jung D, Kling P, Knollmann T, Meyer auf der Heide F. A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility . In: Hillel E, Palmieri R, Riviére E, eds. Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) . Vol 253. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz Zentrum für Informatik; 2023:15:1–15:25. doi:10.4230/LIPIcs.OPODIS.2022.15","chicago":"Castenow, Jannik, Jonas Harbig, Daniel Jung, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility .” In Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) , edited by Eshcar Hillel, Roberto Palmieri, and Etienne Riviére, 253:15:1–15:25. Leibniz International Proceedings in Informatics (LIPIcs). Brussels: Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.OPODIS.2022.15.","bibtex":"@inproceedings{Castenow_Harbig_Jung_Kling_Knollmann_Meyer auf der Heide_2023, place={Brussels}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility }, volume={253}, DOI={10.4230/LIPIcs.OPODIS.2022.15}, booktitle={Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) }, publisher={Schloss Dagstuhl – Leibniz Zentrum für Informatik}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Hillel, Eshcar and Palmieri, Roberto and Riviére, Etienne}, year={2023}, pages={15:1–15:25}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","mla":"Castenow, Jannik, et al. “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility .” Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) , edited by Eshcar Hillel et al., vol. 253, Schloss Dagstuhl – Leibniz Zentrum für Informatik, 2023, p. 15:1–15:25, doi:10.4230/LIPIcs.OPODIS.2022.15.","short":"J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: E. Hillel, R. Palmieri, E. Riviére (Eds.), Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) , Schloss Dagstuhl – Leibniz Zentrum für Informatik, Brussels, 2023, p. 15:1–15:25.","ieee":"J. Castenow, J. Harbig, D. Jung, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Unifying Approach to Efficient (Near-)Gathering of Disoriented Robots with Limited Visibility ,” in Proceedings of the 26th International Conference on Principles of Distributed Systems (OPODIS) , Brussels, 2023, vol. 253, p. 15:1–15:25, doi: 10.4230/LIPIcs.OPODIS.2022.15."},"year":"2023"},{"volume":51,"date_created":"2023-04-20T08:59:14Z","status":"public","keyword":["Applied Mathematics","Industrial and Manufacturing Engineering","Management Science and Operations Research","Software"],"publication":"Operations Research Letters","publisher":"Elsevier BV","author":[{"full_name":"Maack, Marten","first_name":"Marten","last_name":"Maack"}],"user_id":"88252","page":"220-225","citation":{"short":"M. Maack, Operations Research Letters 51 (2023) 220–225.","ieee":"M. Maack, “Online load balancing on uniform machines with limited migration,” Operations Research Letters, vol. 51, no. 3, pp. 220–225, 2023, doi: 10.1016/j.orl.2023.02.013.","chicago":"Maack, Marten. “Online Load Balancing on Uniform Machines with Limited Migration.” Operations Research Letters 51, no. 3 (2023): 220–25. https://doi.org/10.1016/j.orl.2023.02.013.","apa":"Maack, M. (2023). Online load balancing on uniform machines with limited migration. Operations Research Letters, 51(3), 220–225. https://doi.org/10.1016/j.orl.2023.02.013","ama":"Maack M. Online load balancing on uniform machines with limited migration. Operations Research Letters. 2023;51(3):220-225. doi:10.1016/j.orl.2023.02.013","bibtex":"@article{Maack_2023, title={Online load balancing on uniform machines with limited migration}, volume={51}, DOI={10.1016/j.orl.2023.02.013}, number={3}, journal={Operations Research Letters}, publisher={Elsevier BV}, author={Maack, Marten}, year={2023}, pages={220–225} }","mla":"Maack, Marten. “Online Load Balancing on Uniform Machines with Limited Migration.” Operations Research Letters, vol. 51, no. 3, Elsevier BV, 2023, pp. 220–25, doi:10.1016/j.orl.2023.02.013."},"year":"2023","type":"journal_article","issue":"3","intvolume":" 51","_id":"44077","publication_identifier":{"issn":["0167-6377"]},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"}],"department":[{"_id":"63"}],"title":"Online load balancing on uniform machines with limited migration","language":[{"iso":"eng"}],"doi":"10.1016/j.orl.2023.02.013","date_updated":"2023-04-21T07:53:42Z"},{"type":"book_chapter","citation":{"chicago":"Castenow, Jannik, Jonas Harbig, and Friedhelm Meyer auf der Heide. “Unifying Gathering Protocols for Swarms of Mobile Robots.” In Lecture Notes in Computer Science. Cham: Springer International Publishing, 2023. https://doi.org/10.1007/978-3-031-30448-4_1.","apa":"Castenow, J., Harbig, J., & Meyer auf der Heide, F. (2023). Unifying Gathering Protocols for Swarms of Mobile Robots. In Lecture Notes in Computer Science. Springer International Publishing. https://doi.org/10.1007/978-3-031-30448-4_1","ama":"Castenow J, Harbig J, Meyer auf der Heide F. Unifying Gathering Protocols for Swarms of Mobile Robots. In: Lecture Notes in Computer Science. Springer International Publishing; 2023. doi:10.1007/978-3-031-30448-4_1","mla":"Castenow, Jannik, et al. “Unifying Gathering Protocols for Swarms of Mobile Robots.” Lecture Notes in Computer Science, Springer International Publishing, 2023, doi:10.1007/978-3-031-30448-4_1.","bibtex":"@inbook{Castenow_Harbig_Meyer auf der Heide_2023, place={Cham}, title={Unifying Gathering Protocols for Swarms of Mobile Robots}, DOI={10.1007/978-3-031-30448-4_1}, booktitle={Lecture Notes in Computer Science}, publisher={Springer International Publishing}, author={Castenow, Jannik and Harbig, Jonas and Meyer auf der Heide, Friedhelm}, year={2023} }","short":"J. Castenow, J. Harbig, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2023.","ieee":"J. Castenow, J. Harbig, and F. Meyer auf der Heide, “Unifying Gathering Protocols for Swarms of Mobile Robots,” in Lecture Notes in Computer Science, Cham: Springer International Publishing, 2023."},"year":"2023","language":[{"iso":"eng"}],"doi":"10.1007/978-3-031-30448-4_1","date_updated":"2023-05-11T13:14:43Z","_id":"44769","publication_status":"published","publication_identifier":{"isbn":["9783031304477","9783031304484"],"issn":["0302-9743","1611-3349"]},"status":"public","date_created":"2023-05-11T13:13:45Z","project":[{"_id":"106","name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme"}],"author":[{"id":"38705","last_name":"Castenow","full_name":"Castenow, Jannik","first_name":"Jannik"},{"id":"47213","last_name":"Harbig","full_name":"Harbig, Jonas","first_name":"Jonas"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"publisher":"Springer International Publishing","publication":"Lecture Notes in Computer Science","department":[{"_id":"63"}],"title":"Unifying Gathering Protocols for Swarms of Mobile Robots","user_id":"38705","place":"Cham"},{"title":"Local Protocols for Contracting and Expanding Robot Formation Problems","user_id":"38705","status":"public","project":[{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"5","grant_number":"160364472","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)"},{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472","_id":"1"}],"date_created":"2023-06-12T13:06:58Z","author":[{"first_name":"Jannik","full_name":"Castenow, Jannik","last_name":"Castenow","id":"38705"}],"department":[{"_id":"63"}],"doi":"10.17619/UNIPB/1-1750","date_updated":"2023-06-13T07:43:11Z","_id":"45580","type":"dissertation","citation":{"ieee":"J. Castenow, Local Protocols for Contracting and Expanding Robot Formation Problems. 2023.","short":"J. Castenow, Local Protocols for Contracting and Expanding Robot Formation Problems, 2023.","mla":"Castenow, Jannik. Local Protocols for Contracting and Expanding Robot Formation Problems. 2023, doi:10.17619/UNIPB/1-1750.","bibtex":"@book{Castenow_2023, title={Local Protocols for Contracting and Expanding Robot Formation Problems}, DOI={10.17619/UNIPB/1-1750}, author={Castenow, Jannik}, year={2023} }","chicago":"Castenow, Jannik. Local Protocols for Contracting and Expanding Robot Formation Problems, 2023. https://doi.org/10.17619/UNIPB/1-1750.","apa":"Castenow, J. (2023). Local Protocols for Contracting and Expanding Robot Formation Problems. https://doi.org/10.17619/UNIPB/1-1750","ama":"Castenow J. Local Protocols for Contracting and Expanding Robot Formation Problems.; 2023. doi:10.17619/UNIPB/1-1750"},"year":"2023","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"language":[{"iso":"eng"}]},{"department":[{"_id":"63"}],"author":[{"id":"39241","last_name":"Knollmann","orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till","first_name":"Till"}],"date_created":"2023-06-12T13:05:04Z","project":[{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"grant_number":"160364472","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)","_id":"5"},{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472","_id":"1"}],"status":"public","title":"Online Algorithms for Allocating Heterogeneous Resources","user_id":"39241","type":"dissertation","year":"2023","citation":{"bibtex":"@book{Knollmann_2023, title={Online Algorithms for Allocating Heterogeneous Resources}, DOI={10.17619/UNIPB/1-1751}, author={Knollmann, Till}, year={2023} }","mla":"Knollmann, Till. Online Algorithms for Allocating Heterogeneous Resources. 2023, doi:10.17619/UNIPB/1-1751.","apa":"Knollmann, T. (2023). Online Algorithms for Allocating Heterogeneous Resources. https://doi.org/10.17619/UNIPB/1-1751","ama":"Knollmann T. Online Algorithms for Allocating Heterogeneous Resources.; 2023. doi:10.17619/UNIPB/1-1751","chicago":"Knollmann, Till. Online Algorithms for Allocating Heterogeneous Resources, 2023. https://doi.org/10.17619/UNIPB/1-1751.","ieee":"T. Knollmann, Online Algorithms for Allocating Heterogeneous Resources. 2023.","short":"T. Knollmann, Online Algorithms for Allocating Heterogeneous Resources, 2023."},"language":[{"iso":"eng"}],"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_updated":"2023-06-12T21:03:14Z","_id":"45579","doi":"10.17619/UNIPB/1-1751"},{"_id":"45781","date_updated":"2023-07-14T09:27:44Z","doi":"10.17619/UNIPB/1-1768 ","year":"2023","type":"dissertation","citation":{"ieee":"S. Pukrop, On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling. 2023.","short":"S. Pukrop, On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling, 2023.","mla":"Pukrop, Simon. On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling. 2023, doi:10.17619/UNIPB/1-1768 .","bibtex":"@book{Pukrop_2023, title={On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling}, DOI={10.17619/UNIPB/1-1768 }, author={Pukrop, Simon}, year={2023} }","ama":"Pukrop S. On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling.; 2023. doi:10.17619/UNIPB/1-1768 ","apa":"Pukrop, S. (2023). On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling. https://doi.org/10.17619/UNIPB/1-1768 ","chicago":"Pukrop, Simon. On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling, 2023. https://doi.org/10.17619/UNIPB/1-1768 ."},"language":[{"iso":"eng"}],"supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"title":"On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling","user_id":"15504","author":[{"id":"44428","last_name":"Pukrop","full_name":"Pukrop, Simon","first_name":"Simon"}],"department":[{"_id":"63"}],"status":"public","project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","grant_number":"160364472"}],"date_created":"2023-06-27T05:24:19Z"},{"date_updated":"2024-01-11T11:19:33Z","doi":"10.1007/s00453-023-01189-x","language":[{"iso":"eng"}],"title":"Server Cloud Scheduling","department":[{"_id":"63"}],"project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"16","grant_number":"160364472","name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)"}],"publication_identifier":{"issn":["0178-4617","1432-0541"]},"publication_status":"published","_id":"50458","type":"journal_article","citation":{"short":"M. Maack, F. Meyer auf der Heide, S. Pukrop, Algorithmica (2023).","ieee":"M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Server Cloud Scheduling,” Algorithmica, 2023, doi: 10.1007/s00453-023-01189-x.","chicago":"Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Server Cloud Scheduling.” Algorithmica, 2023. https://doi.org/10.1007/s00453-023-01189-x.","ama":"Maack M, Meyer auf der Heide F, Pukrop S. Server Cloud Scheduling. Algorithmica. Published online 2023. doi:10.1007/s00453-023-01189-x","apa":"Maack, M., Meyer auf der Heide, F., & Pukrop, S. (2023). Server Cloud Scheduling. Algorithmica. https://doi.org/10.1007/s00453-023-01189-x","bibtex":"@article{Maack_Meyer auf der Heide_Pukrop_2023, title={Server Cloud Scheduling}, DOI={10.1007/s00453-023-01189-x}, journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2023} }","mla":"Maack, Marten, et al. “Server Cloud Scheduling.” Algorithmica, Springer Science and Business Media LLC, 2023, doi:10.1007/s00453-023-01189-x."},"year":"2023","abstract":[{"lang":"eng","text":"AbstractConsider a set of jobs connected to a directed acyclic task graph with a fixed source and sink. The edges of this graph model precedence constraints and the jobs have to be scheduled with respect to those. We introduce the server cloud scheduling problem, in which the jobs have to be processed either on a single local machine or on one of infinitely many cloud machines. For each job, processing times both on the server and in the cloud are given. Furthermore, for each edge in the task graph, a communication delay is included in the input and has to be taken into account if one of the two jobs is scheduled on the server and the other in the cloud. The server processes jobs sequentially, whereas the cloud can serve as many as needed in parallel, but induces costs. We consider both makespan and cost minimization. The main results are an FPTAS for the makespan objective for graphs with a constant source and sink dividing cut and strong hardness for the case with unit processing times and delays."}],"extern":"1","user_id":"44428","author":[{"last_name":"Maack","id":"88252","first_name":"Marten","full_name":"Maack, Marten"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Pukrop, Simon","first_name":"Simon","id":"44428","last_name":"Pukrop"}],"publisher":"Springer Science and Business Media LLC","keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"publication":"Algorithmica","status":"public","date_created":"2024-01-11T11:10:53Z"},{"department":[{"_id":"63"}],"publication":"2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","publisher":"IEEE","author":[{"first_name":"Max A.","full_name":"Deppert, Max A.","last_name":"Deppert"},{"last_name":"Jansen","first_name":"Klaus","full_name":"Jansen, Klaus"},{"id":"88252","last_name":"Maack","full_name":"Maack, Marten","first_name":"Marten"},{"id":"44428","last_name":"Pukrop","full_name":"Pukrop, Simon","first_name":"Simon"},{"first_name":"Malin","full_name":"Rau, Malin","last_name":"Rau"}],"publication_status":"published","date_created":"2024-01-11T11:30:14Z","project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","grant_number":"160364472"}],"status":"public","title":"Scheduling with Many Shared Resources","user_id":"44428","type":"conference","year":"2023","citation":{"apa":"Deppert, M. A., Jansen, K., Maack, M., Pukrop, S., & Rau, M. (2023). Scheduling with Many Shared Resources. 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS). https://doi.org/10.1109/ipdps54959.2023.00049","ama":"Deppert MA, Jansen K, Maack M, Pukrop S, Rau M. Scheduling with Many Shared Resources. In: 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE; 2023. doi:10.1109/ipdps54959.2023.00049","chicago":"Deppert, Max A., Klaus Jansen, Marten Maack, Simon Pukrop, and Malin Rau. “Scheduling with Many Shared Resources.” In 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 2023. https://doi.org/10.1109/ipdps54959.2023.00049.","bibtex":"@inproceedings{Deppert_Jansen_Maack_Pukrop_Rau_2023, title={Scheduling with Many Shared Resources}, DOI={10.1109/ipdps54959.2023.00049}, booktitle={2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Deppert, Max A. and Jansen, Klaus and Maack, Marten and Pukrop, Simon and Rau, Malin}, year={2023} }","mla":"Deppert, Max A., et al. “Scheduling with Many Shared Resources.” 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2023, doi:10.1109/ipdps54959.2023.00049.","short":"M.A. Deppert, K. Jansen, M. Maack, S. Pukrop, M. Rau, in: 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2023.","ieee":"M. A. Deppert, K. Jansen, M. Maack, S. Pukrop, and M. Rau, “Scheduling with Many Shared Resources,” 2023, doi: 10.1109/ipdps54959.2023.00049."},"language":[{"iso":"eng"}],"date_updated":"2024-01-11T11:31:11Z","_id":"50460","doi":"10.1109/ipdps54959.2023.00049"},{"user_id":"38705","title":"A Discrete and Continuous Study of the Max-Chain-Formation Problem","publisher":"Elsevier BV","author":[{"id":"38705","last_name":"Castenow","full_name":"Castenow, Jannik","first_name":"Jannik"},{"full_name":"Kling, Peter","first_name":"Peter","last_name":"Kling"},{"orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till","first_name":"Till","id":"39241","last_name":"Knollmann"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication":"Information and Computation","department":[{"_id":"63"}],"keyword":["Computational Theory and Mathematics","Computer Science Applications","Information Systems","Theoretical Computer Science"],"status":"public","project":[{"name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme","_id":"106"}],"date_created":"2022-02-15T07:38:28Z","publication_status":"published","publication_identifier":{"issn":["0890-5401"]},"_id":"29843","date_updated":"2022-02-15T07:41:00Z","article_number":"104877","doi":"10.1016/j.ic.2022.104877","language":[{"iso":"eng"}],"citation":{"mla":"Castenow, Jannik, et al. “A Discrete and Continuous Study of the Max-Chain-Formation Problem.” Information and Computation, 104877, Elsevier BV, 2022, doi:10.1016/j.ic.2022.104877.","bibtex":"@article{Castenow_Kling_Knollmann_Meyer auf der Heide_2022, title={A Discrete and Continuous Study of the Max-Chain-Formation Problem}, DOI={10.1016/j.ic.2022.104877}, number={104877}, journal={Information and Computation}, publisher={Elsevier BV}, author={Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, year={2022} }","apa":"Castenow, J., Kling, P., Knollmann, T., & Meyer auf der Heide, F. (2022). A Discrete and Continuous Study of the Max-Chain-Formation Problem. Information and Computation, Article 104877. https://doi.org/10.1016/j.ic.2022.104877","ama":"Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. A Discrete and Continuous Study of the Max-Chain-Formation Problem. Information and Computation. Published online 2022. doi:10.1016/j.ic.2022.104877","chicago":"Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Discrete and Continuous Study of the Max-Chain-Formation Problem.” Information and Computation, 2022. https://doi.org/10.1016/j.ic.2022.104877.","ieee":"J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Discrete and Continuous Study of the Max-Chain-Formation Problem,” Information and Computation, Art. no. 104877, 2022, doi: 10.1016/j.ic.2022.104877.","short":"J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, Information and Computation (2022)."},"type":"journal_article","year":"2022"}]