{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:23:23Z","timestamp":1740140603353,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,11,25]],"date-time":"2017-11-25T00:00:00Z","timestamp":1511568000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China under","doi-asserted-by":"crossref","award":["61502099"],"award-info":[{"award-number":["61502099"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61320106007"],"award-info":[{"award-number":["61320106007"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61632008"],"award-info":[{"award-number":["61632008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61320106007"],"award-info":[{"award-number":["61320106007"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Jiangsu Provincial Key Laboratory of Network and Information Security","award":["BM2003201"],"award-info":[{"award-number":["BM2003201"]}]},{"name":"Key Laboratory of Computer Network and Information Integration of Ministry of Education of China","award":["93K-9"],"award-info":[{"award-number":["93K-9"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672154"],"award-info":[{"award-number":["61672154"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1186\/s13638-017-0986-0","type":"journal-article","created":{"date-parts":[[2017,11,24]],"date-time":"2017-11-24T22:26:49Z","timestamp":1511562409000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling multi-task jobs with extra utility in data centers"],"prefix":"10.1186","volume":"2017","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0164-2596","authenticated-orcid":false,"given":"Xiaolin","family":"Fang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junzhou","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiwei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingshu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,25]]},"reference":[{"key":"986_CR1","volume-title":"Assignment Problems in Parallel and Distributed Computing, vol. 32","author":"SH Bokhari","year":"2012","unstructured":"SH Bokhari, Assignment Problems in Parallel and Distributed Computing, vol. 32 (Springer US, New York, 2012)."},{"key":"986_CR2","unstructured":"M Armbrust, A Fox, R Griffith, AD Joseph, R Katz, A Konwinski, et al., A view of cloud computing. Commun. ACM. 53(4), 50\u201358 (2010). Available from: URL http:\/\/doi.acm.org\/10.1145\/1721654.1721672 ."},{"key":"986_CR3","doi-asserted-by":"crossref","unstructured":"Q Zhang, L Cheng, R Boutaba, Cloud computing: state-of-the-art and research challenges. J. Int. Serv. Appl. 1(1), 7\u201318 (2010). Available from: http:\/\/dx.doi.org\/10.1007\/s13174-010-0007-6 .","DOI":"10.1007\/s13174-010-0007-6"},{"issue":"4","key":"986_CR4","doi-asserted-by":"crossref","first-page":"1326","DOI":"10.1109\/TWC.2010.04.080749","volume":"9","author":"V Sharma","year":"2010","unstructured":"V Sharma, U Mukherji, V Joseph, S. Gupta, Optimal energy management policies for energy harvesting sensor nodes. IEEE Trans. Wirel. Commun. 9(4), 1326\u20131336 (2010).","journal-title":"IEEE Trans. Wirel. Commun"},{"issue":"12","key":"986_CR5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/MC.2003.1250880","volume":"36","author":"C Lefurgy","year":"2003","unstructured":"C Lefurgy, K Rajamani, F Rawson, W Felter, M Kistler, TW Keller, Energy management for commercial servers. Computer. 36(12), 39\u201348 (2003).","journal-title":"Computer"},{"key":"986_CR6","doi-asserted-by":"crossref","unstructured":"RL Graham, EL Lawler, JK Lenstra, AHGR Kan, in Discrete Optimization IIProceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, Aha. and Vancouver. vol. 5 of Annals of Discrete Mathematics, ed. by ELJ P L Hammer, BH Korte. Optimization and approximation in deterministic sequencing and scheduling: a survey (Elsevier, 1979), pp. 287\u2013326. Available from: http:\/\/www.sciencedirect.com\/science\/article\/pii\/S016750600870356X . Accessed 29 Apr 2008.","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"986_CR7","doi-asserted-by":"crossref","unstructured":"D Applegate, W Cook, A computational study of the job-shop scheduling problem. ORSA J. Comput. 3(2), 149\u2013156.","DOI":"10.1287\/ijoc.3.2.149"},{"key":"986_CR8","doi-asserted-by":"crossref","unstructured":"EL Lawler, JK Lenstra, AHGR Kan, DB Shmoys, in Logistics of Production and Inventory. vol. 4 of Handbooks in Operations Research and Management Science. Chapter 9. Sequencing and scheduling: algorithms and complexity (Elsevier, 1993), pp. 445\u2013522. Available from: http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0927050705801896 .","DOI":"10.1016\/S0927-0507(05)80189-6"},{"issue":"1","key":"986_CR9","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J Blazewicz","year":"1983","unstructured":"J Blazewicz, JK Lenstra, AHGR Kan, Scheduling subject to resource constraints: classification and complexity. Discret. Appl. Math. 5(1), 11\u201324 (1983). Available from: http:\/\/www.sciencedirect.com\/science\/article\/pii\/0166218X83900124 . Accessed 9 Sept 2002.","journal-title":"Discret. Appl. Math"},{"key":"986_CR10","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1109\/CLOUD.2015.47","volume-title":"2015 IEEE 8th International Conference on Cloud Computing","author":"Y Zheng","year":"2015","unstructured":"Y Zheng, B Ji, N Shroff, P Sinha, in 2015 IEEE 8th International Conference on Cloud Computing. Forget the deadline: scheduling interactive applications in data centers (IEEENew York, 2015), pp. 293\u2013300."},{"issue":"3","key":"986_CR11","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0206029","volume":"6","author":"MR Garey","year":"1977","unstructured":"MR Garey, DS Johnson, Two-processor scheduling with start-times and deadlines. SIAM J. Comput. 6(3), 416\u2013426 (1977).","journal-title":"SIAM J. Comput"},{"key":"986_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"MR Garey, DS Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman & Co, New York, 1979)."},{"key":"986_CR13","doi-asserted-by":"crossref","unstructured":"A Bar-Noy, S Guha, JS Naor, B Schieber, in Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing. STOC \u201999. Approximating the throughput of multiple machines under real-time scheduling (ACMNew York, 1999), pp. 622\u2013631. Available from: http:\/\/doi.acm.org\/10.1145\/301250.301420 .","DOI":"10.1145\/301250.301420"},{"key":"986_CR14","unstructured":"A Bar-Noy, R Bar-Yehuda, A Freund, J (Seffi) Naor, B Schieber, A unified approach to approximating resource allocation and scheduling. J. ACM. 48(5), 1069\u20131090 (2001). Available from: http:\/\/doi.acm.org\/10.1145\/502102.502107 ."},{"key":"986_CR15","unstructured":"G Calinescu, A Chakrabarti, H Karloff, Y Rabani, An improved approximation algorithm for resource allocation. ACM Trans. Algorithms. 7(4), 48:1\u201348:7 (2011). Available from: http:\/\/doi.acm.org\/10.1145\/2000807.2000816 ."},{"key":"986_CR16","doi-asserted-by":"crossref","unstructured":"EL Lawler, A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Ann. Oper. Res. 26(1-4), 125\u2013133 (1991). Available from: http:\/\/dx.doi.org\/10.1007\/BF02248588 .","DOI":"10.1007\/BF02248588"},{"issue":"1","key":"986_CR17","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0166-218X(96)00043-1","volume":"72","author":"G Steiner","year":"1997","unstructured":"G Steiner, Models and algorithms for planning and scheduling problems minimizing the number of tardy jobs with precedence constraints and agreeable due dates. Discret. Appl. Math. 72(1), 167\u2013177 (1997). Available from: http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X96000431 . Accessed 10 Jan.","journal-title":"Discret. Appl. Math"},{"key":"986_CR18","doi-asserted-by":"crossref","unstructured":"H Kise, T Ibaraki, H Mine, A solvable case of the one-machine scheduling problem with ready and due times. Oper. Res. 26(1), 121\u2013126 (1978). Available from: http:\/\/dx.doi.org\/10.1287\/opre.26.1.121 .","DOI":"10.1287\/opre.26.1.121"},{"key":"986_CR19","volume-title":"Nonoverlapping Local Alignments, Weighted Independent Sets of Axis Parallel Rectangles","author":"V Bafna","year":"1995","unstructured":"V Bafna, B Narayanan, R6 Ravi, Nonoverlapping Local Alignments, Weighted Independent Sets of Axis Parallel Rectangles (Center for Discrete Mathematics & Theoretical Computer Science,Princeton, 1995)."},{"key":"986_CR20","unstructured":"P Berman, B DasGupta, S Muthukrishnan, in Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA \u201902. Simple approximation algorithm for nonoverlapping local alignments (Society for Industrial and Applied MathematicsPhiladelphia, 2002), pp. 677\u2013678. Available from: http:\/\/dl.acm.org\/citation.cfm?id=545381.545471 ."},{"key":"986_CR21","unstructured":"R Bar-Yehuda, MM Halld\u00f3rsson, JS Naor, H Shachnai, I Shapira, in Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA \u201902. Scheduling split intervals (Society for Industrial and Applied MathematicsPhiladelphia, 2002), pp. 732\u2013741. Available from: http:\/\/dl.acm.org\/citation.cfm?id=545381.545479 ."},{"key":"986_CR22","doi-asserted-by":"crossref","unstructured":"R Bar-Yehuda, D Rawitz, Using fractional primal-dual to schedule split intervals with demands. Discret. Optim. 3(4), 275\u2013287 (2006). Available from: http:\/\/dx.doi.org\/10.1016\/j.disopt.2006.05.010 .","DOI":"10.1016\/j.disopt.2006.05.010"},{"key":"986_CR23","doi-asserted-by":"crossref","unstructured":"VT Chakaravarthy, A Roy Choudhury, S Roy, Y Sabharwal, in Proceedings of the 19th International Conference on Parallel Processing. Euro-Par\u201913. Scheduling jobs with multiple non-uniform tasks (Springer-VerlagBerlin, Heidelberg, 2013), pp. 90\u2013101. Available from: http:\/\/dx.doi.org\/10.1007\/978-3-642-40047-6_12 .","DOI":"10.1007\/978-3-642-40047-6_12"}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-017-0986-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13638-017-0986-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-017-0986-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,6]],"date-time":"2019-10-06T16:36:12Z","timestamp":1570379772000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-017-0986-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,25]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["986"],"URL":"https:\/\/doi.org\/10.1186\/s13638-017-0986-0","relation":{},"ISSN":["1687-1499"],"issn-type":[{"type":"electronic","value":"1687-1499"}],"subject":[],"published":{"date-parts":[[2017,11,25]]},"article-number":"200"}}