{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T03:38:58Z","timestamp":1777606738291,"version":"3.51.4"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319592497","type":"print"},{"value":"9783319592503","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59250-3_2","type":"book-chapter","created":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T09:04:39Z","timestamp":1495530279000},"page":"13-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["On Scheduling Coflows"],"prefix":"10.1007","author":[{"given":"Saba","family":"Ahmadi","sequence":"first","affiliation":[]},{"given":"Samir","family":"Khuller","sequence":"additional","affiliation":[]},{"given":"Manish","family":"Purohit","sequence":"additional","affiliation":[]},{"given":"Sheng","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,24]]},"reference":[{"key":"2_CR1","unstructured":"https:\/\/hadoop.apache.org"},{"key":"2_CR2","unstructured":"http:\/\/cs.umd.edu\/~samir\/ipco17-fullversion.pdf"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-14165-2_22","volume-title":"Automata, Languages and Programming","author":"N Bansal","year":"2010","unstructured":"Bansal, N., Khot, S.: Inapproximability of hypergraph vertex cover and applications to scheduling problems. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 250\u2013261. Springer, Heidelberg (2010). doi:\n                    10.1007\/978-3-642-14165-2_22"},{"issue":"6","key":"2_CR4","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1287\/opre.1070.0412","volume":"55","author":"Z-L Chen","year":"2007","unstructured":"Chen, Z.-L., Hall, N.G.: Supply chain scheduling: conflict and cooperation in assembly systems. Oper. Res. 55(6), 1072\u20131089 (2007)","journal-title":"Oper. Res."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Chowdhury, M., Stoica, I. Coflow: a networking abstraction for cluster applications. In: ACM Workshop on Hot Topics in Networks, pp. 31\u201336. ACM (2012)","DOI":"10.1145\/2390231.2390237"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Chowdhury, M., Stoica, I.: Efficient coflow scheduling without prior knowledge. In: SIGCOMM, pp. 393\u2013406. ACM (2015)","DOI":"10.1145\/2829988.2787480"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Chowdhury, M., Zhong, Y., Stoica, I.: Efficient coflow scheduling with varys. In: SIGCOMM, SIGCOMM 2014, pp. 443\u2013454. ACM, New York (2014)","DOI":"10.1145\/2740070.2626315"},{"issue":"2","key":"2_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.orl.2012.12.001","volume":"41","author":"JM Davis","year":"2013","unstructured":"Davis, J.M., Gandhi, R., Kothari, V.H.: Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine. Oper. Res. Lett. 41(2), 121\u2013125 (2013)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. Commun. ACM 51(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-77050-3_8","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"N Garg","year":"2007","unstructured":"Garg, N., Kumar, A., Pandit, V.: Order scheduling models: hardness and algorithms. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 96\u2013107. Springer, Heidelberg (2007). doi:\n                    10.1007\/978-3-540-77050-3_8"},{"key":"2_CR11","unstructured":"Khuller, S., Li, J., Sturmfels, P., Sun, K., Venkat, P.: Select, permute: an improved online framework for scheduling to minimize weighted completion time (2016) (Submitted)"},{"issue":"8","key":"2_CR12","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1016\/j.dam.2006.09.012","volume":"155","author":"JY-T Leung","year":"2007","unstructured":"Leung, J.Y.-T., Li, H., Pinedo, M.: Scheduling orders for multiple product types to minimize total weighted completion time. Discrete Appl. Math. 155(8), 945\u2013970 (2007)","journal-title":"Discrete Appl. Math."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Luo, S., Yu, H., Zhao, Y., Wang, S., Yu, S., Li, L.: Towards practical, near-optimal coflow scheduling for data center networks. IEEE Trans. Parallel Distrib. Syst. PP(99), 1 (2016)","DOI":"10.1109\/TPDS.2016.2525767"},{"issue":"5","key":"2_CR14","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.orl.2010.04.011","volume":"38","author":"M Mastrolilli","year":"2010","unstructured":"Mastrolilli, M., Queyranne, M., Schulz, A.S., Svensson, O., Uhan, N.A.: Minimizing the sum of weighted completion times in a concurrent open shop. Oper. Res. Lett. 38(5), 390\u2013395 (2010)","journal-title":"Oper. Res. Lett."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Qiu, Z., Stein, C., Zhong, Y.: Minimizing the total weighted completion time of coflows in datacenter networks. In: SPAA 2015, pp. 294\u2013303. ACM, New York (2015)","DOI":"10.1145\/2755573.2755592"},{"issue":"1\u20133","key":"2_CR16","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01581271","volume":"58","author":"M Queyranne","year":"1993","unstructured":"Queyranne, M.: Structure of a simple scheduling polyhedron. Math. Program. 58(1\u20133), 263\u2013285 (1993)","journal-title":"Math. Program."},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Sachdeva, S., Saket, R.: Optimal inapproximability for scheduling problems via structural hardness for hypergraph vertex cover. In: IEEE Conference on Computational Complexity, pp. 219\u2013229. IEEE (2013)","DOI":"10.1109\/CCC.2013.30"},{"issue":"5","key":"2_CR18","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.omega.2005.09.007","volume":"35","author":"G Wang","year":"2007","unstructured":"Wang, G., Cheng, T.E.: Customer order scheduling to minimize total weighted completion time. Omega 35(5), 623\u2013626 (2007)","journal-title":"Omega"},{"key":"2_CR19","first-page":"10","volume":"10","author":"M Zaharia","year":"2010","unstructured":"Zaharia, M., Chowdhury, M., Franklin, M.J., Shenker, S., Stoica, I.: Spark: cluster computing with working sets. HotCloud 10, 10 (2010)","journal-title":"HotCloud"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Chen, K., Bai, W., Yu, M., Tian, C., Geng, Y., Zhang, Y., Li, D., Wang, S. Rapier: integrating routing and scheduling for coflow-aware data center networks. In: INFOCOM, pp. 424\u2013432. IEEE (2015)","DOI":"10.1109\/INFOCOM.2015.7218408"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59250-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T09:21:31Z","timestamp":1578475291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59250-3_2"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319592497","9783319592503"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59250-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"24 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Waterloo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.math.uwaterloo.ca\/ipco2017\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}