[{"doi":"10.1007/s00453-023-01189-x","title":"Server Cloud Scheduling","author":[{"first_name":"Marten","id":"88252","full_name":"Maack, Marten","last_name":"Maack"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Simon","full_name":"Pukrop, Simon","id":"44428","last_name":"Pukrop"}],"date_created":"2024-01-11T11:10:53Z","publisher":"Springer Science and Business Media LLC","date_updated":"2024-01-11T11:19:33Z","citation":{"apa":"Maack, M., Meyer auf der Heide, F., &#38; Pukrop, S. (2023). Server Cloud Scheduling. <i>Algorithmica</i>. <a href=\"https://doi.org/10.1007/s00453-023-01189-x\">https://doi.org/10.1007/s00453-023-01189-x</a>","bibtex":"@article{Maack_Meyer auf der Heide_Pukrop_2023, title={Server Cloud Scheduling}, DOI={<a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>}, journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2023} }","short":"M. Maack, F. Meyer auf der Heide, S. Pukrop, Algorithmica (2023).","mla":"Maack, Marten, et al. “Server Cloud Scheduling.” <i>Algorithmica</i>, Springer Science and Business Media LLC, 2023, doi:<a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>.","ieee":"M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Server Cloud Scheduling,” <i>Algorithmica</i>, 2023, doi: <a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>.","chicago":"Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Server Cloud Scheduling.” <i>Algorithmica</i>, 2023. <a href=\"https://doi.org/10.1007/s00453-023-01189-x\">https://doi.org/10.1007/s00453-023-01189-x</a>.","ama":"Maack M, Meyer auf der Heide F, Pukrop S. Server Cloud Scheduling. <i>Algorithmica</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1007/s00453-023-01189-x\">10.1007/s00453-023-01189-x</a>"},"year":"2023","publication_identifier":{"issn":["0178-4617","1432-0541"]},"publication_status":"published","extern":"1","language":[{"iso":"eng"}],"keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"department":[{"_id":"63"}],"user_id":"44428","_id":"50458","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"_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"}],"status":"public","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>Consider 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.</jats:p>","lang":"eng"}],"publication":"Algorithmica","type":"journal_article"},{"publication_status":"published","citation":{"ama":"Deppert MA, Jansen K, Maack M, Pukrop S, Rau M. Scheduling with Many Shared Resources. In: <i>2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. IEEE; 2023. doi:<a href=\"https://doi.org/10.1109/ipdps54959.2023.00049\">10.1109/ipdps54959.2023.00049</a>","chicago":"Deppert, Max A., Klaus Jansen, Marten Maack, Simon Pukrop, and Malin Rau. “Scheduling with Many Shared Resources.” In <i>2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. IEEE, 2023. <a href=\"https://doi.org/10.1109/ipdps54959.2023.00049\">https://doi.org/10.1109/ipdps54959.2023.00049</a>.","ieee":"M. A. Deppert, K. Jansen, M. Maack, S. Pukrop, and M. Rau, “Scheduling with Many Shared Resources,” 2023, doi: <a href=\"https://doi.org/10.1109/ipdps54959.2023.00049\">10.1109/ipdps54959.2023.00049</a>.","apa":"Deppert, M. A., Jansen, K., Maack, M., Pukrop, S., &#38; Rau, M. (2023). Scheduling with Many Shared Resources. <i>2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. <a href=\"https://doi.org/10.1109/ipdps54959.2023.00049\">https://doi.org/10.1109/ipdps54959.2023.00049</a>","mla":"Deppert, Max A., et al. “Scheduling with Many Shared Resources.” <i>2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, IEEE, 2023, doi:<a href=\"https://doi.org/10.1109/ipdps54959.2023.00049\">10.1109/ipdps54959.2023.00049</a>.","bibtex":"@inproceedings{Deppert_Jansen_Maack_Pukrop_Rau_2023, title={Scheduling with Many Shared Resources}, DOI={<a href=\"https://doi.org/10.1109/ipdps54959.2023.00049\">10.1109/ipdps54959.2023.00049</a>}, 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} }","short":"M.A. Deppert, K. Jansen, M. Maack, S. Pukrop, M. Rau, in: 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2023."},"year":"2023","date_created":"2024-01-11T11:30:14Z","author":[{"first_name":"Max A.","full_name":"Deppert, Max A.","last_name":"Deppert"},{"last_name":"Jansen","full_name":"Jansen, Klaus","first_name":"Klaus"},{"id":"88252","full_name":"Maack, Marten","last_name":"Maack","first_name":"Marten"},{"first_name":"Simon","last_name":"Pukrop","full_name":"Pukrop, Simon","id":"44428"},{"first_name":"Malin","full_name":"Rau, Malin","last_name":"Rau"}],"publisher":"IEEE","date_updated":"2024-01-11T11:31:11Z","doi":"10.1109/ipdps54959.2023.00049","title":"Scheduling with Many Shared Resources","type":"conference","publication":"2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","status":"public","user_id":"44428","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"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"grant_number":"160364472","_id":"16","name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)"}],"_id":"50460","language":[{"iso":"eng"}]},{"year":"2023","publisher":"Heinz Nixdorf Institut, Universität Paderborn","date_created":"2023-07-07T08:24:28Z","title":"On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers","publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2023-07-07T11:16:52Z","date_created":"2023-07-07T08:24:20Z","creator":"florida","file_size":1803186,"file_name":"C4-Chapter-SFB-Buch-Final.pdf","access_level":"open_access","file_id":"45896"}],"ddc":["004"],"language":[{"iso":"eng"}],"has_accepted_license":"1","place":"Paderborn","intvolume":"       412","page":"183-202","citation":{"chicago":"Karl, Holger, Marten Maack, Friedhelm Meyer auf der Heide, Simon Pukrop, and Adrian Redder. “On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers.” In <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:183–202. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.5281/zenodo.8068664\">https://doi.org/10.5281/zenodo.8068664</a>.","ieee":"H. Karl, M. Maack, F. Meyer auf der Heide, S. Pukrop, and A. Redder, “On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers,” in <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 183–202.","short":"H. Karl, M. Maack, F. Meyer auf der Heide, S. Pukrop, A. Redder, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 183–202.","mla":"Karl, Holger, et al. “On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers.” <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 183–202, doi:<a href=\"https://doi.org/10.5281/zenodo.8068664\">10.5281/zenodo.8068664</a>.","bibtex":"@inbook{Karl_Maack_Meyer auf der Heide_Pukrop_Redder_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers}, volume={412}, DOI={<a href=\"https://doi.org/10.5281/zenodo.8068664\">10.5281/zenodo.8068664</a>}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Karl, Holger and Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon and Redder, Adrian}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={183–202}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","apa":"Karl, H., Maack, M., Meyer auf der Heide, F., Pukrop, S., &#38; Redder, A. (2023). On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, &#38; H. Wehrheim (Eds.), <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412, pp. 183–202). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.5281/zenodo.8068664\">https://doi.org/10.5281/zenodo.8068664</a>","ama":"Karl H, Maack M, Meyer auf der Heide F, Pukrop S, Redder A. On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:183-202. doi:<a href=\"https://doi.org/10.5281/zenodo.8068664\">10.5281/zenodo.8068664</a>"},"oa":"1","date_updated":"2023-07-07T11:16:53Z","volume":412,"author":[{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"},{"full_name":"Maack, Marten","id":"88252","last_name":"Maack","first_name":"Marten"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"id":"44428","full_name":"Pukrop, Simon","last_name":"Pukrop","first_name":"Simon"},{"full_name":"Redder, Adrian","id":"52265","last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688","first_name":"Adrian"}],"doi":"10.5281/zenodo.8068664","type":"book_chapter","editor":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","last_name":"Haake"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Platzner","full_name":"Platzner, Marco","first_name":"Marco"},{"full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"}],"status":"public","_id":"45895","project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"grant_number":"160364472","name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","_id":"16"}],"department":[{"_id":"7"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","user_id":"477","file_date_updated":"2023-07-07T11:16:52Z"},{"type":"dissertation","status":"public","user_id":"15504","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"grant_number":"160364472","name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","_id":"16"}],"_id":"45781","language":[{"iso":"eng"}],"citation":{"bibtex":"@book{Pukrop_2023, title={On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1768 \">10.17619/UNIPB/1-1768 </a>}, author={Pukrop, Simon}, year={2023} }","short":"S. Pukrop, On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling, 2023.","mla":"Pukrop, Simon. <i>On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling</i>. 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1768 \">10.17619/UNIPB/1-1768 </a>.","apa":"Pukrop, S. (2023). <i>On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1768 \">https://doi.org/10.17619/UNIPB/1-1768 </a>","chicago":"Pukrop, Simon. <i>On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling</i>, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1768 \">https://doi.org/10.17619/UNIPB/1-1768 </a>.","ieee":"S. Pukrop, <i>On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling</i>. 2023.","ama":"Pukrop S. <i>On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling</i>.; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1768 \">10.17619/UNIPB/1-1768 </a>"},"year":"2023","supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"author":[{"last_name":"Pukrop","full_name":"Pukrop, Simon","id":"44428","first_name":"Simon"}],"date_created":"2023-06-27T05:24:19Z","date_updated":"2023-07-14T09:27:44Z","doi":"10.17619/UNIPB/1-1768 ","title":"On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling"},{"volume":244,"date_created":"2022-09-27T13:06:05Z","author":[{"first_name":"Marten","last_name":"Maack","full_name":"Maack, Marten","id":"88252"},{"first_name":"Simon","last_name":"Pukrop","id":"44428","full_name":"Pukrop, Simon"},{"first_name":"Anna Rodriguez","last_name":"Rasmussen","full_name":"Rasmussen, Anna Rodriguez"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2022-11-18T10:14:14Z","doi":"10.4230/LIPIcs.ESA.2022.77","title":"(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling","intvolume":"       244","page":"77:1–77:13","citation":{"bibtex":"@inproceedings{Maack_Pukrop_Rasmussen_2022, series={LIPIcs}, title={(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling}, volume={244}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>}, booktitle={30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Maack, Marten and Pukrop, Simon and Rasmussen, Anna Rodriguez}, editor={Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, year={2022}, pages={77:1–77:13}, collection={LIPIcs} }","mla":"Maack, Marten, et al. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.” <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, edited by Shiri Chechik et al., vol. 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>.","short":"M. Maack, S. Pukrop, A.R. Rasmussen, in: S. Chechik, G. Navarro, E. Rotenberg, G. Herman (Eds.), 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13.","apa":"Maack, M., Pukrop, S., &#38; Rasmussen, A. R. (2022). (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In S. Chechik, G. Navarro, E. Rotenberg, &#38; G. Herman (Eds.), <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i> (Vol. 244, p. 77:1–77:13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">https://doi.org/10.4230/LIPIcs.ESA.2022.77</a>","ama":"Maack M, Pukrop S, Rasmussen AR. (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In: Chechik S, Navarro G, Rotenberg E, Herman G, eds. <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>. Vol 244. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:77:1–77:13. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>","chicago":"Maack, Marten, Simon Pukrop, and Anna Rodriguez Rasmussen. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.” In <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, edited by Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz Herman, 244:77:1–77:13. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">https://doi.org/10.4230/LIPIcs.ESA.2022.77</a>.","ieee":"M. Maack, S. Pukrop, and A. R. Rasmussen, “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling,” in <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, 2022, vol. 244, p. 77:1–77:13, doi: <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>."},"year":"2022","department":[{"_id":"63"}],"user_id":"477","series_title":"LIPIcs","_id":"33491","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"language":[{"iso":"eng"}],"publication":"30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany","type":"conference","status":"public","editor":[{"first_name":"Shiri","last_name":"Chechik","full_name":"Chechik, Shiri"},{"first_name":"Gonzalo","last_name":"Navarro","full_name":"Navarro, Gonzalo"},{"last_name":"Rotenberg","full_name":"Rotenberg, Eva","first_name":"Eva"},{"first_name":"Grzegorz","full_name":"Herman, Grzegorz","last_name":"Herman"}]},{"doi":"10.1007/978-3-030-92702-8_10","title":"Server Cloud Scheduling","author":[{"first_name":"Marten","last_name":"Maack","id":"88252","full_name":"Maack, Marten"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Simon","id":"44428","full_name":"Pukrop, Simon","last_name":"Pukrop"}],"date_created":"2022-02-18T09:31:54Z","publisher":"Springer International Publishing","date_updated":"2022-09-27T15:03:13Z","citation":{"ieee":"M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Server Cloud Scheduling,” in <i>Approximation and Online Algorithms</i>, Cham: Springer International Publishing, 2022.","chicago":"Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Server Cloud Scheduling.” In <i>Approximation and Online Algorithms</i>. Cham: Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-030-92702-8_10\">https://doi.org/10.1007/978-3-030-92702-8_10</a>.","ama":"Maack M, Meyer auf der Heide F, Pukrop S. Server Cloud Scheduling. In: <i>Approximation and Online Algorithms</i>. Springer International Publishing; 2022. doi:<a href=\"https://doi.org/10.1007/978-3-030-92702-8_10\">10.1007/978-3-030-92702-8_10</a>","apa":"Maack, M., Meyer auf der Heide, F., &#38; Pukrop, S. (2022). Server Cloud Scheduling. In <i>Approximation and Online Algorithms</i>. Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-92702-8_10\">https://doi.org/10.1007/978-3-030-92702-8_10</a>","short":"M. Maack, F. Meyer auf der Heide, S. Pukrop, in: Approximation and Online Algorithms, Springer International Publishing, Cham, 2022.","bibtex":"@inbook{Maack_Meyer auf der Heide_Pukrop_2022, place={Cham}, title={Server Cloud Scheduling}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-92702-8_10\">10.1007/978-3-030-92702-8_10</a>}, booktitle={Approximation and Online Algorithms}, publisher={Springer International Publishing}, author={Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2022} }","mla":"Maack, Marten, et al. “Server Cloud Scheduling.” <i>Approximation and Online Algorithms</i>, Springer International Publishing, 2022, doi:<a href=\"https://doi.org/10.1007/978-3-030-92702-8_10\">10.1007/978-3-030-92702-8_10</a>."},"place":"Cham","year":"2022","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030927011","9783030927028"]},"publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"44428","_id":"29872","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"}],"status":"public","publication":"Approximation and Online Algorithms","type":"book_chapter"},{"title":"Full Version -- Server Cloud Scheduling","author":[{"first_name":"Marten","last_name":"Maack","id":"88252","full_name":"Maack, Marten"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"id":"44428","full_name":"Pukrop, Simon","last_name":"Pukrop","first_name":"Simon"}],"date_created":"2021-11-24T13:23:58Z","date_updated":"2022-09-27T15:03:19Z","citation":{"bibtex":"@article{Maack_Meyer auf der Heide_Pukrop_2021, title={Full Version -- Server Cloud Scheduling}, journal={arXiv:2108.02109}, author={Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2021} }","short":"M. Maack, F. Meyer auf der Heide, S. Pukrop, ArXiv:2108.02109 (2021).","mla":"Maack, Marten, et al. “Full Version -- Server Cloud Scheduling.” <i>ArXiv:2108.02109</i>, 2021.","apa":"Maack, M., Meyer auf der Heide, F., &#38; Pukrop, S. (2021). Full Version -- Server Cloud Scheduling. In <i>arXiv:2108.02109</i>.","ama":"Maack M, Meyer auf der Heide F, Pukrop S. Full Version -- Server Cloud Scheduling. <i>arXiv:210802109</i>. Published online 2021.","ieee":"M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Full Version -- Server Cloud Scheduling,” <i>arXiv:2108.02109</i>. 2021.","chicago":"Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Full Version -- Server Cloud Scheduling.” <i>ArXiv:2108.02109</i>, 2021."},"year":"2021","language":[{"iso":"eng"}],"user_id":"44428","department":[{"_id":"63"},{"_id":"26"}],"_id":"27778","status":"public","abstract":[{"text":"Consider a set of jobs connected to a directed acyclic task graph with a\r\nfixed source and sink. The edges of this graph model precedence constraints and\r\nthe jobs have to be scheduled with respect to those. We introduce the Server\r\nCloud Scheduling problem, in which the jobs have to be processed either on a\r\nsingle local machine or on one of many cloud machines. Both the source and the\r\nsink have to be scheduled on the local machine. For each job, processing times\r\nboth on the server and in the cloud are given. Furthermore, for each edge in\r\nthe task graph, a communication delay is included in the input and has to be\r\ntaken into account if one of the two jobs is scheduled on the server, the other\r\nin the cloud. The server can process jobs sequentially, whereas the cloud can\r\nserve as many as needed in parallel, but induces costs. We consider both\r\nmakespan and cost minimization. The main results are an FPTAS with respect for\r\nthe makespan objective for a fairly general case and strong hardness for the\r\ncase with unit processing times and delays.","lang":"eng"}],"type":"preprint","publication":"arXiv:2108.02109"},{"language":[{"iso":"eng"}],"_id":"13868","project":[{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"department":[{"_id":"63"}],"user_id":"44428","status":"public","publication":"Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)","type":"conference","title":"Approximating Weighted Completion Time for Order Scheduling with Setup Times","date_updated":"2022-01-06T06:51:45Z","date_created":"2019-10-15T12:19:49Z","author":[{"first_name":"Simon","last_name":"Pukrop","full_name":"Pukrop, Simon","id":"44428"},{"last_name":"Mäcker","full_name":"Mäcker, Alexander","id":"13536","first_name":"Alexander"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"year":"2020","citation":{"short":"S. Pukrop, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2020.","bibtex":"@inproceedings{Pukrop_Mäcker_Meyer auf der Heide_2020, title={Approximating Weighted Completion Time for Order Scheduling with Setup Times}, booktitle={Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)}, author={Pukrop, Simon and Mäcker, Alexander and Meyer auf der Heide, Friedhelm}, year={2020} }","mla":"Pukrop, Simon, et al. “Approximating Weighted Completion Time for Order Scheduling with Setup Times.” <i>Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)</i>, 2020.","apa":"Pukrop, S., Mäcker, A., &#38; Meyer auf der Heide, F. (2020). Approximating Weighted Completion Time for Order Scheduling with Setup Times. In <i>Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)</i>.","chicago":"Pukrop, Simon, Alexander Mäcker, and Friedhelm Meyer auf der Heide. “Approximating Weighted Completion Time for Order Scheduling with Setup Times.” In <i>Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)</i>, 2020.","ieee":"S. Pukrop, A. Mäcker, and F. Meyer auf der Heide, “Approximating Weighted Completion Time for Order Scheduling with Setup Times,” in <i>Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)</i>, 2020.","ama":"Pukrop S, Mäcker A, Meyer auf der Heide F. Approximating Weighted Completion Time for Order Scheduling with Setup Times. In: <i>Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)</i>. ; 2020."}}]