[{"status":"public","_id":"50458","publisher":"Springer Science and Business Media LLC","user_id":"44428","citation":{"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} }","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>","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>.","short":"M. Maack, F. Meyer auf der Heide, S. Pukrop, Algorithmica (2023).","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>.","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>.","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>"},"project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_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)"}],"title":"Server Cloud Scheduling","year":"2023","publication_identifier":{"issn":["0178-4617","1432-0541"]},"author":[{"id":"88252","full_name":"Maack, Marten","first_name":"Marten","last_name":"Maack"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Simon","last_name":"Pukrop","full_name":"Pukrop, Simon","id":"44428"}],"date_updated":"2024-01-11T11:19:33Z","publication_status":"published","language":[{"iso":"eng"}],"doi":"10.1007/s00453-023-01189-x","publication":"Algorithmica","abstract":[{"lang":"eng","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>"}],"extern":"1","date_created":"2024-01-11T11:10:53Z","type":"journal_article","keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"department":[{"_id":"63"}]},{"doi":"10.1109/ipdps54959.2023.00049","user_id":"44428","_id":"50460","language":[{"iso":"eng"}],"publisher":"IEEE","date_updated":"2024-01-11T11:31:11Z","publication_status":"published","author":[{"last_name":"Deppert","first_name":"Max A.","full_name":"Deppert, Max A."},{"full_name":"Jansen, Klaus","first_name":"Klaus","last_name":"Jansen"},{"id":"88252","first_name":"Marten","last_name":"Maack","full_name":"Maack, Marten"},{"id":"44428","first_name":"Simon","last_name":"Pukrop","full_name":"Pukrop, Simon"},{"full_name":"Rau, Malin","last_name":"Rau","first_name":"Malin"}],"title":"Scheduling with Many Shared Resources","year":"2023","status":"public","department":[{"_id":"63"}],"type":"conference","date_created":"2024-01-11T11:30:14Z","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","_id":"16","grant_number":"160364472"}],"citation":{"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} }","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>","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>.","short":"M.A. Deppert, K. Jansen, M. Maack, S. Pukrop, M. Rau, in: 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2023.","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>"},"publication":"2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)"},{"file_date_updated":"2023-07-07T11:16:52Z","citation":{"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} }","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>.","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>","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.","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.","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>","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>."},"project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"},{"_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)"}],"place":"Paderborn","oa":"1","status":"public","has_accepted_license":"1","page":"183-202","_id":"45895","publisher":"Heinz Nixdorf Institut, Universität Paderborn","user_id":"477","ddc":["004"],"volume":412,"editor":[{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco"},{"full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","file":[{"content_type":"application/pdf","file_id":"45896","date_updated":"2023-07-07T11:16:52Z","relation":"main_file","file_size":1803186,"access_level":"open_access","file_name":"C4-Chapter-SFB-Buch-Final.pdf","date_created":"2023-07-07T08:24:20Z","creator":"florida"}],"date_created":"2023-07-07T08:24:28Z","type":"book_chapter","department":[{"_id":"7"}],"year":"2023","title":"On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers","author":[{"last_name":"Karl","first_name":"Holger","full_name":"Karl, Holger","id":"126"},{"last_name":"Maack","first_name":"Marten","full_name":"Maack, Marten","id":"88252"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"id":"44428","last_name":"Pukrop","first_name":"Simon","full_name":"Pukrop, Simon"},{"full_name":"Redder, Adrian","last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688","first_name":"Adrian","id":"52265"}],"date_updated":"2023-07-07T11:16:53Z","intvolume":"       412","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","language":[{"iso":"eng"}],"doi":"10.5281/zenodo.8068664"},{"date_updated":"2023-07-14T09:27:44Z","author":[{"id":"44428","last_name":"Pukrop","first_name":"Simon","full_name":"Pukrop, Simon"}],"status":"public","title":"On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling","year":"2023","user_id":"15504","doi":"10.17619/UNIPB/1-1768 ","language":[{"iso":"eng"}],"_id":"45781","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"},{"name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","_id":"16","grant_number":"160364472"}],"citation":{"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>","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} }","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>.","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>.","short":"S. Pukrop, On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling, 2023.","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>","ieee":"S. Pukrop, <i>On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling</i>. 2023."},"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"department":[{"_id":"63"}],"type":"dissertation","date_created":"2023-06-27T05:24:19Z"},{"citation":{"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.","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>.","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>","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>.","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>","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>."},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"status":"public","_id":"33491","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","page":"77:1–77:13","volume":244,"editor":[{"last_name":"Chechik","first_name":"Shiri","full_name":"Chechik, Shiri"},{"full_name":"Navarro, Gonzalo","first_name":"Gonzalo","last_name":"Navarro"},{"last_name":"Rotenberg","first_name":"Eva","full_name":"Rotenberg, Eva"},{"full_name":"Herman, Grzegorz","last_name":"Herman","first_name":"Grzegorz"}],"user_id":"477","publication":"30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany","date_created":"2022-09-27T13:06:05Z","department":[{"_id":"63"}],"type":"conference","author":[{"id":"88252","first_name":"Marten","last_name":"Maack","full_name":"Maack, Marten"},{"id":"44428","full_name":"Pukrop, Simon","first_name":"Simon","last_name":"Pukrop"},{"first_name":"Anna Rodriguez","last_name":"Rasmussen","full_name":"Rasmussen, Anna Rodriguez"}],"year":"2022","title":"(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling","intvolume":"       244","date_updated":"2022-11-18T10:14:14Z","series_title":"LIPIcs","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.ESA.2022.77"},{"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"}],"citation":{"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} }","short":"M. Maack, F. Meyer auf der Heide, S. Pukrop, in: Approximation and Online Algorithms, Springer International Publishing, Cham, 2022.","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>","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>.","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.","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>","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>."},"publication":"Approximation and Online Algorithms","department":[{"_id":"63"}],"type":"book_chapter","date_created":"2022-02-18T09:31:54Z","place":"Cham","publication_status":"published","date_updated":"2022-09-27T15:03:13Z","publication_identifier":{"isbn":["9783030927011","9783030927028"],"issn":["0302-9743","1611-3349"]},"author":[{"id":"88252","first_name":"Marten","last_name":"Maack","full_name":"Maack, Marten"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"id":"44428","full_name":"Pukrop, Simon","first_name":"Simon","last_name":"Pukrop"}],"year":"2022","title":"Server Cloud Scheduling","status":"public","user_id":"44428","doi":"10.1007/978-3-030-92702-8_10","language":[{"iso":"eng"}],"_id":"29872","publisher":"Springer International Publishing"},{"department":[{"_id":"63"},{"_id":"26"}],"type":"preprint","date_created":"2021-11-24T13:23:58Z","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"}],"citation":{"ieee":"M. Maack, F. Meyer auf der Heide, and S. Pukrop, “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>.","chicago":"Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Full Version -- Server Cloud Scheduling.” <i>ArXiv:2108.02109</i>, 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.","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} }","ama":"Maack M, Meyer auf der Heide F, Pukrop S. Full Version -- Server Cloud Scheduling. <i>arXiv:210802109</i>. Published online 2021."},"publication":"arXiv:2108.02109","user_id":"44428","language":[{"iso":"eng"}],"_id":"27778","date_updated":"2022-09-27T15:03:19Z","author":[{"id":"88252","last_name":"Maack","first_name":"Marten","full_name":"Maack, Marten"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"id":"44428","last_name":"Pukrop","first_name":"Simon","full_name":"Pukrop, Simon"}],"status":"public","year":"2021","title":"Full Version -- Server Cloud Scheduling"},{"title":"Approximating Weighted Completion Time for Order Scheduling with Setup Times","year":"2020","status":"public","author":[{"last_name":"Pukrop","first_name":"Simon","full_name":"Pukrop, Simon","id":"44428"},{"id":"13536","first_name":"Alexander","last_name":"Mäcker","full_name":"Mäcker, Alexander"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_updated":"2022-01-06T06:51:45Z","_id":"13868","language":[{"iso":"eng"}],"user_id":"44428","publication":"Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)","citation":{"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} }","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.","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.","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.","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.","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>."},"project":[{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"date_created":"2019-10-15T12:19:49Z","type":"conference","department":[{"_id":"63"}]},{"title":"Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine","year":"2019","status":"public","author":[{"first_name":"Simon","last_name":"Pukrop","full_name":"Pukrop, Simon"}],"date_updated":"2022-01-06T06:50:37Z","_id":"10344","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","user_id":"477","citation":{"short":"S. Pukrop, Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine, Universität Paderborn, 2019.","chicago":"Pukrop, Simon. <i>Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine</i>. Universität Paderborn, 2019.","ieee":"S. Pukrop, <i>Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine</i>. Universität Paderborn, 2019.","apa":"Pukrop, S. (2019). <i>Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine</i>. Universität Paderborn.","bibtex":"@book{Pukrop_2019, title={Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine}, publisher={Universität Paderborn}, author={Pukrop, Simon}, year={2019} }","ama":"Pukrop S. <i>Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine</i>. Universität Paderborn; 2019.","mla":"Pukrop, Simon. <i>Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine</i>. Universität Paderborn, 2019."},"supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"date_created":"2019-07-04T07:21:19Z","type":"mastersthesis","department":[{"_id":"63"}]},{"related_material":{"link":[{"relation":"software","url":"https://github.com/upbcuk"}]},"abstract":[{"text":"We present CLARC (Cryptographic Library for Anonymous Reputation and Credentials), an anonymous credentials system (ACS) combined with an anonymous reputation system.\r\n\r\nUsing CLARC, users can receive attribute-based credentials from issuers. They can efficiently prove that their credentials satisfy complex (access) policies in a privacy-preserving way. This implements anonymous access control with complex policies.\r\n\r\nFurthermore, CLARC is the first ACS that is combined with an anonymous reputation system where users can anonymously rate services. A user who gets access to a service via a credential, also anonymously receives a review token to rate the service. If a user creates more than a single rating, this can be detected by anyone, preventing users from spamming ratings to sway public opinion.\r\n\r\nTo evaluate feasibility of our construction, we present an open-source prototype implementation.","lang":"eng"}],"publication":"Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES '18","department":[{"_id":"64"}],"type":"conference","date_created":"2018-06-14T11:19:29Z","file":[{"creator":"feidens","date_created":"2018-11-08T10:17:39Z","access_level":"closed","file_size":920843,"file_name":"react_acs.pdf","date_updated":"2018-11-08T10:17:39Z","relation":"main_file","content_type":"application/pdf","file_id":"5428"}],"date_updated":"2022-01-06T06:59:07Z","publication_status":"accepted","author":[{"first_name":"Kai","last_name":"Bemmann","full_name":"Bemmann, Kai"},{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"},{"full_name":"Bobolz, Jan","last_name":"Bobolz","first_name":"Jan","id":"27207"},{"id":"41047","full_name":"Bröcher, Henrik","last_name":"Bröcher","first_name":"Henrik"},{"full_name":"Diemert, Denis Pascal","first_name":"Denis Pascal","last_name":"Diemert","id":"44071"},{"last_name":"Eidens","first_name":"Fabian","full_name":"Eidens, Fabian","id":"25078"},{"last_name":"Eilers","first_name":"Lukas","full_name":"Eilers, Lukas"},{"id":"44413","last_name":"Haltermann","first_name":"Jan Frederik","full_name":"Haltermann, Jan Frederik"},{"id":"48090","full_name":"Juhnke, Jakob","last_name":"Juhnke","first_name":"Jakob"},{"last_name":"Otour","first_name":"Burhan","full_name":"Otour, Burhan"},{"id":"47434","first_name":"Laurens Alexander","last_name":"Porzenheim","full_name":"Porzenheim, Laurens Alexander"},{"last_name":"Pukrop","first_name":"Simon","full_name":"Pukrop, Simon"},{"full_name":"Schilling, Erik","last_name":"Schilling","first_name":"Erik"},{"full_name":"Schlichtig, Michael","first_name":"Michael","last_name":"Schlichtig","id":"32312"},{"full_name":"Stienemeier, Marcel","last_name":"Stienemeier","first_name":"Marcel"}],"publication_identifier":{"isbn":["978-1-4503-6448-5"]},"title":"Fully-Featured Anonymous Credentials with Reputation System","year":"2018","doi":"10.1145/3230833.3234517","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://eprint.iacr.org/2018/835","open_access":"1"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"44","name":"KogniHome - die mitdenkende Wohnung"}],"quality_controlled":"1","citation":{"mla":"Bemmann, Kai, et al. “Fully-Featured Anonymous Credentials with Reputation System.” <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>, ACM, doi:<a href=\"https://doi.org/10.1145/3230833.3234517\">10.1145/3230833.3234517</a>.","ama":"Bemmann K, Blömer J, Bobolz J, et al. Fully-Featured Anonymous Credentials with Reputation System. In: <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM. doi:<a href=\"https://doi.org/10.1145/3230833.3234517\">10.1145/3230833.3234517</a>","bibtex":"@inproceedings{Bemmann_Blömer_Bobolz_Bröcher_Diemert_Eidens_Eilers_Haltermann_Juhnke_Otour_et al., place={New York, NY, USA}, title={Fully-Featured Anonymous Credentials with Reputation System}, DOI={<a href=\"https://doi.org/10.1145/3230833.3234517\">10.1145/3230833.3234517</a>}, booktitle={Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18}, publisher={ACM}, author={Bemmann, Kai and Blömer, Johannes and Bobolz, Jan and Bröcher, Henrik and Diemert, Denis Pascal and Eidens, Fabian and Eilers, Lukas and Haltermann, Jan Frederik and Juhnke, Jakob and Otour, Burhan and et al.} }","apa":"Bemmann, K., Blömer, J., Bobolz, J., Bröcher, H., Diemert, D. P., Eidens, F., … Stienemeier, M. (n.d.). Fully-Featured Anonymous Credentials with Reputation System. In <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM. <a href=\"https://doi.org/10.1145/3230833.3234517\">https://doi.org/10.1145/3230833.3234517</a>","ieee":"K. Bemmann <i>et al.</i>, “Fully-Featured Anonymous Credentials with Reputation System,” in <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>, Hamburg, Germany.","chicago":"Bemmann, Kai, Johannes Blömer, Jan Bobolz, Henrik Bröcher, Denis Pascal Diemert, Fabian Eidens, Lukas Eilers, et al. “Fully-Featured Anonymous Credentials with Reputation System.” In <i>Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM, n.d. <a href=\"https://doi.org/10.1145/3230833.3234517\">https://doi.org/10.1145/3230833.3234517</a>.","short":"K. Bemmann, J. Blömer, J. Bobolz, H. Bröcher, D.P. Diemert, F. Eidens, L. Eilers, J.F. Haltermann, J. Juhnke, B. Otour, L.A. Porzenheim, S. Pukrop, E. Schilling, M. Schlichtig, M. Stienemeier, in: Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, ACM, New York, NY, USA, n.d."},"file_date_updated":"2018-11-08T10:17:39Z","oa":"1","place":"New York, NY, USA","has_accepted_license":"1","conference":{"end_date":"2018-08-30","start_date":"2018-08-27","name":"ARES 2018 - SECPID","location":"Hamburg, Germany"},"status":"public","ddc":["000"],"user_id":"25078","publisher":"ACM","_id":"3265"},{"date_updated":"2022-01-06T06:50:50Z","author":[{"last_name":"Pukrop","first_name":"Simon","full_name":"Pukrop, Simon"}],"title":"Robuste Optimierung in Congestion Games","status":"public","year":"2017","user_id":"14052","_id":"1074","language":[{"iso":"ger"}],"publisher":"Universität Paderborn","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"citation":{"apa":"Pukrop, S. (2017). <i>Robuste Optimierung in Congestion Games</i>. Universität Paderborn.","ieee":"S. Pukrop, <i>Robuste Optimierung in Congestion Games</i>. Universität Paderborn, 2017.","chicago":"Pukrop, Simon. <i>Robuste Optimierung in Congestion Games</i>. Universität Paderborn, 2017.","short":"S. Pukrop, Robuste Optimierung in Congestion Games, Universität Paderborn, 2017.","mla":"Pukrop, Simon. <i>Robuste Optimierung in Congestion Games</i>. Universität Paderborn, 2017.","ama":"Pukrop S. <i>Robuste Optimierung in Congestion Games</i>. Universität Paderborn; 2017.","bibtex":"@book{Pukrop_2017, title={Robuste Optimierung in Congestion Games}, publisher={Universität Paderborn}, author={Pukrop, Simon}, year={2017} }"},"supervisor":[{"full_name":"Skopalik, Alexander","last_name":"Skopalik","first_name":"Alexander","id":"40384"}],"department":[{"_id":"63"},{"_id":"541"}],"type":"bachelorsthesis","date_created":"2017-12-19T10:00:25Z"}]