{"author":[{"first_name":"Marten","last_name":"Maack","id":"88252","full_name":"Maack, Marten"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Simon","id":"44428","last_name":"Pukrop","full_name":"Pukrop, Simon"}],"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"}],"status":"public","year":"2021","citation":{"apa":"Maack, M., Meyer auf der Heide, F., & Pukrop, S. (2021). Full Version -- Server Cloud Scheduling. In arXiv:2108.02109.","mla":"Maack, Marten, et al. “Full Version -- Server Cloud Scheduling.” ArXiv:2108.02109, 2021.","ama":"Maack M, Meyer auf der Heide F, Pukrop S. Full Version -- Server Cloud Scheduling. arXiv:210802109. Published online 2021.","ieee":"M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Full Version -- Server Cloud Scheduling,” arXiv:2108.02109. 2021.","short":"M. Maack, F. Meyer auf der Heide, S. Pukrop, ArXiv:2108.02109 (2021).","chicago":"Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Full Version -- Server Cloud Scheduling.” ArXiv:2108.02109, 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} }"},"user_id":"44428","date_created":"2021-11-24T13:23:58Z","department":[{"_id":"63"},{"_id":"26"}],"title":"Full Version -- Server Cloud Scheduling","_id":"27778","language":[{"iso":"eng"}],"publication":"arXiv:2108.02109","date_updated":"2022-09-27T15:03:19Z","type":"preprint"}