{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:41:27Z","timestamp":1742913687300,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774039"},{"type":"electronic","value":"9783319774046"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_49","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"669-682","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time"],"prefix":"10.1007","author":[{"given":"Samir","family":"Khuller","sequence":"first","affiliation":[]},{"given":"Jingling","family":"Li","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Sturmfels","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Prayaag","family":"Venkat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"key":"49_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-59250-3_2","volume-title":"Integer Programming and Combinatorial Optimization","author":"S Ahmadi","year":"2017","unstructured":"Ahmadi, S., Khuller, S., Purohit, M., Yang, S.: On scheduling coflows. In: Eisenbrand, F., Koenemann, J. (eds.) IPCO 2017. LNCS, vol. 10328, pp. 13\u201324. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59250-3_2"},{"key":"49_CR2","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). https:\/\/doi.org\/10.1007\/978-3-642-14165-2_22"},{"key":"49_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1007\/3-540-61440-0_166","volume-title":"Automata, Languages and Programming","author":"S Chakrabarti","year":"1996","unstructured":"Chakrabarti, S., Phillips, C.A., Schulz, A.S., Shmoys, D.B., Stein, C., Wein, J.: Improved scheduling algorithms for minsum criteria. In: Meyer, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 646\u2013657. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61440-0_166"},{"key":"49_CR4","unstructured":"Chen, Z.L., Hall, N.G.: Supply chain scheduling: assembly systems. Technical report. University of Pennsylvania (2000)"},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Chowdhury, M., Stoica, I.: Coflow: a networking abstraction for cluster applications. In: HotNets, pp. 31\u201336 (2012)","DOI":"10.1145\/2390231.2390237"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Chowdhury, M., Zhong, Y., Stoica, I.: Efficient coflow scheduling with Varys. In: ACM SIGCOMM CCR, vol. 44, pp. 443\u2013454. ACM (2014)","DOI":"10.1145\/2740070.2626315"},{"issue":"8","key":"49_CR7","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1002\/nav.20484","volume":"58","author":"T Edwin Cheng","year":"2011","unstructured":"Edwin Cheng, T., Nong, Q., Ng, C.T.: Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time. Nav. Res. Logist. 58(8), 763\u2013770 (2011)","journal-title":"Nav. Res. Logist."},{"key":"49_CR8","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). https:\/\/doi.org\/10.1007\/978-3-540-77050-3_8"},{"key":"49_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discret. Math."},{"issue":"3","key":"49_CR10","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/moor.22.3.513","volume":"22","author":"LA Hall","year":"1997","unstructured":"Hall, L.A., Schulz, A.S., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Math. Oper. Res. 22(3), 513\u2013544 (1997)","journal-title":"Math. Oper. Res."},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Hung, C.C., Golubchik, L., Yu, M.: Scheduling jobs across geo-distributed datacenters. In: SoCC, pp. 111\u2013124. ACM (2015)","DOI":"10.1145\/2806777.2806780"},{"key":"49_CR12","unstructured":"Im, S., Purohit, M.: A tight approximation for co-flow scheduling for minimizing total weighted completion time. arXiv preprint arXiv:1707.04331 (2017)"},{"key":"49_CR13","doi-asserted-by":"crossref","unstructured":"Khuller, S., Li, J., Sturmfels, P., Sun, K., Venkat, P.: Select and permute: an improved online framework for scheduling to minimize weighted completion time. arXiv preprint arXiv:1704.06677 (2017)","DOI":"10.1007\/978-3-319-77404-6_49"},{"key":"49_CR14","doi-asserted-by":"crossref","unstructured":"Khuller, S., Purohit, M.: Brief announcement: improved approximation algorithms for scheduling co-flows. In: SPAA, pp. 239\u2013240. ACM (2016)","DOI":"10.1145\/2935764.2935809"},{"issue":"8","key":"49_CR15","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1016\/j.dam.2006.09.012","volume":"155","author":"JYT Leung","year":"2007","unstructured":"Leung, J.Y.T., Li, H., Pinedo, M.: Scheduling orders for multiple product types to minimize total weighted completion time. Discret. Appl. Math. 155(8), 945\u2013970 (2007)","journal-title":"Discret. Appl. Math."},{"key":"49_CR16","doi-asserted-by":"crossref","unstructured":"Li, Y., Jiang, S.H.C., Tan, H., Zhang, C., Chen, G., Zhou, J., Lau, F.: Efficient online coflow routing and scheduling. In: Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 161\u2013170. ACM (2016)","DOI":"10.1145\/2942358.2942367"},{"issue":"1","key":"49_CR17","first-page":"15","volume":"13","author":"E L\u00fcbbecke","year":"2016","unstructured":"L\u00fcbbecke, E., Maurer, O., Megow, N., Wiese, A.: A new approach to online scheduling: approximating the optimal competitive ratio. ACM Trans. Algorithms (TALG) 13(1), 15 (2016)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"5","key":"49_CR18","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":"49_CR19","doi-asserted-by":"crossref","unstructured":"Murray, R., Chao, M., Khuller, S.: Scheduling distributed clusters of parallel machines: primal-dual and LP-based approximation algorithms. In: ESA (2016)","DOI":"10.1007\/s00453-017-0345-x"},{"key":"49_CR20","doi-asserted-by":"crossref","unstructured":"Qiu, Z., Stein, C., Zhong, Y.: Minimizing the total weighted completion time of coflows in datacenter networks. In: SPAA, pp. 294\u2013303. ACM (2015)","DOI":"10.1145\/2755573.2755592"},{"issue":"4","key":"49_CR21","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10951-006-7042-y","volume":"9","author":"TA Roemer","year":"2006","unstructured":"Roemer, T.A.: A note on the complexity of the concurrent open shop problem. J. Sched. 9(4), 389\u2013396 (2006)","journal-title":"J. Sched."},{"key":"49_CR22","doi-asserted-by":"crossref","unstructured":"Sachdeva, S., Saket, R.: Optimal inapproximability for scheduling problems via structural hardness for hypergraph vertex cover. In: CCC, pp. 219\u2013229. IEEE (2013)","DOI":"10.1109\/CCC.2013.30"},{"issue":"5","key":"49_CR23","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"}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:04:26Z","timestamp":1709827466000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}