{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:38:36Z","timestamp":1742913516967,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030859275"},{"type":"electronic","value":"9783030859282"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85928-2_38","type":"book-chapter","created":{"date-parts":[[2021,9,8]],"date-time":"2021-09-08T12:12:16Z","timestamp":1631103136000},"page":"479-493","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Available Time Aware Offloading for\u00a0Dependent Tasks with Cooperative Edge Servers"],"prefix":"10.1007","author":[{"given":"Bingyan","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jigang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,2]]},"reference":[{"issue":"8","key":"38_CR1","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1109\/TPDS.2011.303","volume":"23","author":"S Abrishami","year":"2011","unstructured":"Abrishami, S., Naghibzadeh, M., Epema, D.H.: Cost-driven scheduling of grid workflows using partial critical paths. IEEE Trans. Parallel Distrib. Syst. 23(8), 1400\u20131414 (2011)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"38_CR2","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0167-6377(01)00079-7","volume":"29","author":"J Breit","year":"2001","unstructured":"Breit, J., Schmidt, G., Strusevich, V.A.: Two-machine open shop scheduling with an availability constraint. Oper. Res. Lett. 29(2), 65\u201377 (2001)","journal-title":"Oper. Res. Lett."},{"doi-asserted-by":"crossref","unstructured":"Chen, M.H., Liang, B., Dong, M.: Joint offloading and resource allocation for computation and communication in mobile cloud with computing access point. In: INFOCOM, pp. 1\u20139. IEEE (2017)","key":"38_CR3","DOI":"10.1109\/INFOCOM.2017.8057150"},{"doi-asserted-by":"crossref","unstructured":"Eshraghi, N., Liang, B.: Joint offloading decision and resource allocation with uncertain task computing requirement. In: INFOCOM, pp. 1414\u20131422. IEEE (2019)","key":"38_CR4","DOI":"10.1109\/INFOCOM.2019.8737559"},{"doi-asserted-by":"crossref","unstructured":"Gonzalez, T., Sahni, S.: Open Shop Scheduling to Minimize Finish Time (1976)","key":"38_CR5","DOI":"10.1145\/321978.321985"},{"issue":"3","key":"38_CR6","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/S0377-2217(01)00083-2","volume":"136","author":"W Kubiak","year":"2002","unstructured":"Kubiak, W., B\u0142a\u017cewicz, J., Formanowicz, P., Breit, J., Schmidt, G.: Two-machine flow shops with limited machine availability. Eur. J. Oper. Res. 136(3), 528\u2013540 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"38_CR7","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1002\/nav.20122","volume":"53","author":"MA Kubzin","year":"2006","unstructured":"Kubzin, M.A., Strusevich, V.A., Breit, J., Schmidt, G.: Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints. Naval Res. Logist. (NRL) 53(1), 16\u201323 (2006)","journal-title":"Naval Res. Logist. (NRL)"},{"doi-asserted-by":"publisher","unstructured":"Kulkarni, J., Li, S.: Flow-time optimization for concurrent open-shop and precedence constrained scheduling models. In: Blais, E., Jansen, K., Rolim, J.D.P., Steurer, D. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol. 116, pp. 16:1\u201316:21. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2018). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2018.16. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2018\/9420","key":"38_CR8","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2018.16"},{"unstructured":"Reiss, C., Wilkes, J., Hellerstein, J.: Google cluster-usage traces: format+ schema google inc. Mountain View, CA, USA, White Paper (2011)","key":"38_CR9"},{"issue":"6","key":"38_CR10","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1137\/S0097539793248317","volume":"24","author":"DB Shmoys","year":"1995","unstructured":"Shmoys, D.B., Wein, J., Williamson, D.P.: Scheduling parallel machines on-line. SIAM J. Comput. 24(6), 1313\u20131331 (1995)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"38_CR11","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/71.993206","volume":"13","author":"H Topcuoglu","year":"2002","unstructured":"Topcuoglu, H., Hariri, S., Wu, M.Y.: Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst. 13(3), 260\u2013274 (2002)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"doi-asserted-by":"crossref","unstructured":"Wang, X., Chen, X., Wu, W.: Towards truthful auction mechanisms for task assignment in mobile device clouds. In: IEEE Conference on Computer Communications (INFOCOM), pp. 1\u20139. IEEE (2017)","key":"38_CR12","DOI":"10.1109\/INFOCOM.2017.8057198"},{"issue":"3","key":"38_CR13","doi-asserted-by":"publisher","first-page":"2094","DOI":"10.1109\/JIOT.2018.2823000","volume":"5","author":"Y Yang","year":"2018","unstructured":"Yang, Y., Zhao, S., Zhang, W., Chen, Y., Luo, X., Wang, J.: Debts: delay energy balanced task scheduling in homogeneous fog networks. IEEE Internet Things J. 5(3), 2094\u20132106 (2018)","journal-title":"IEEE Internet Things J."},{"doi-asserted-by":"crossref","unstructured":"Zhang, W., Li, S., Liu, L., Jia, Z., Zhang, Y., Raychaudhuri, D.: Hetero-edge: orchestration of real-time vision applications on heterogeneous edge clouds. In: IEEE Conference on Computer Communications (INFOCOM) (2019)","key":"38_CR14","DOI":"10.1109\/INFOCOM.2019.8737478"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85928-2_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,8]],"date-time":"2021-09-08T12:23:15Z","timestamp":1631103795000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85928-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030859275","9783030859282"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85928-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WASA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Wireless Algorithms, Systems, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wasa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wasa-conference.org\/WASA2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"315","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"103","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}