{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:51Z","timestamp":1759638651597,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2017,7,19]],"date-time":"2017-07-19T00:00:00Z","timestamp":1500422400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,7,19]],"date-time":"2017-07-19T00:00:00Z","timestamp":1500422400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1262805","1217890"],"award-info":[{"award-number":["1262805","1217890"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"name":"The Winkler Foundation"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s00453-017-0345-x","type":"journal-article","created":{"date-parts":[[2017,7,19]],"date-time":"2017-07-19T13:39:52Z","timestamp":1500471592000},"page":"2777-2798","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling Distributed Clusters of Parallel Machines : Primal-Dual and LP-based Approximation Algorithms"],"prefix":"10.1007","volume":"80","author":[{"given":"Riley","family":"Murray","sequence":"first","affiliation":[]},{"given":"Samir","family":"Khuller","sequence":"additional","affiliation":[]},{"given":"Megan","family":"Chao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,19]]},"reference":[{"key":"345_CR1","unstructured":"Inc Amazon Web\u00a0Services.: AWS Lambda - Serverless Compute. URL: \n                    https:\/\/aws.amazon.com\/lambda\/\n                    \n                   2016 Accessed 3 Apr 2016"},{"key":"345_CR2","doi-asserted-by":"publisher","unstructured":"Zhi-Long, Chen., Nicholas, G.: Hall. Supply chain scheduling: assembly systems. Working paper., (2000). doi:\n                    10.1007\/978-3-8349-8667-2","DOI":"10.1007\/978-3-8349-8667-2"},{"key":"345_CR3","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-77050-3_8","volume":"4855","author":"Naveen Garg","year":"2007","unstructured":"Garg, Naveen, Kumar, Amit, Pandit, Vinayaka: Order scheduling models: hardness and algorithms. FSTTCS 2007: Found Softw Technol Theor Comput Sci 4855, 96\u2013107 (2007). doi:\n                    10.1007\/978-3-540-77050-3_8","journal-title":"FSTTCS 2007: Found Softw Technol Theor Comput Sci"},{"issue":"1","key":"345_CR4","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1137\/0206013","volume":"6","author":"Teofilo Gonzalez","year":"1977","unstructured":"Gonzalez, Teofilo, Ibarra, Oscar, Sahni, Sartaj: Bounds for LPT schedules on uniform processors. SIAM J Comput 6(1), 155\u2013166 (1977)","journal-title":"SIAM J Comput"},{"key":"345_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"L Ronald","year":"1979","unstructured":"Ronald, L.: Graham, Eugene L Lawler, Jan Karel Lenstra, and AHG Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Disc Math 5, 287\u2013326 (1979)","journal-title":"Ann Disc Math"},{"key":"345_CR6","unstructured":"Mohammad, Hajjat., Shankaranarayanan, P N., David, Maltz., Sanjay, Rao., Kunwadee, Sripanidkulchai.: Dealer : application-aware request splitting for interactive cloud applications. CoNEXT 2012, 157\u2013168 (2012)"},{"key":"345_CR7","doi-asserted-by":"crossref","unstructured":"Chien-Chun, Hung., Leana, Golubchik., Minlan, Yu.: Scheduling jobs across geo-distributed datacenters. In: proceedings of the sixth ACM symposium on cloud computing (ACM), 111\u2013124 (2015)","DOI":"10.1145\/2806777.2806780"},{"issue":"8","key":"345_CR8","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, Haibing, Pinedo, Michael: Scheduling orders for multiple product types to minimize total weighted completion time. Disc Appl Math 155(8), 945\u2013970 (2007). doi:\n                    10.1016\/j.dam.2006.09.012","journal-title":"Disc Appl Math"},{"issue":"5","key":"345_CR9","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.orl.2010.04.011","volume":"38","author":"Monaldo Mastrolilli","year":"2010","unstructured":"Mastrolilli, Monaldo, Queyranne, Maurice, Schulz, Andreas S., Svensson, Ola, Uhan, Nelson A.: Minimizing the sum of weighted completion times in a concurrent open shop. Oper Res Lett 38(5), 390\u2013395 (2010). doi:\n                    10.1016\/j.orl.2010.04.011","journal-title":"Oper Res Lett"},{"key":"345_CR10","unstructured":"Microsoft.: Azure Service Fabric. URL: \n                    https:\/\/azure.microsoft.com\/en-us\/services\/service-fabric\/\n                    \n                   (2016) Accessed 3 Apr 2016"},{"issue":"1\u20133","key":"345_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01581271","volume":"58","author":"Maurice Queyranne","year":"1993","unstructured":"Queyranne, Maurice: Structure of a simple scheduling polyhedron. Math Progr 58(1\u20133), 263\u2013285 (1993). doi:\n                    10.1007\/BF01581271","journal-title":"Math Progr"},{"key":"345_CR12","doi-asserted-by":"crossref","unstructured":"Sushant, Sachdeva., Rishi Saket.: Optimal inapproximability for scheduling problems via structural hardness for hypergraph vertex cover. In: IEEE conference on computational complexity (IEEE), 219\u2013229 (2013)","DOI":"10.1109\/CCC.2013.30"},{"key":"345_CR13","unstructured":"Andreas S. Schulz.: Polytopes and scheduling. Ph.D Thesis (1996)"},{"key":"345_CR14","unstructured":"Andreas\u00a0S, Schulz.: From linear programming relaxations to approximation algorithms for scheduling problems : a tour d \u2019 horizon. Working paper; available upon request (2012)"},{"key":"345_CR15","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1016\/0377-2217(93)90347-P","volume":"71","author":"C Sriskandarajah","year":"1993","unstructured":"Sriskandarajah, C., Wagneur, E.: Openshops with jobs overlap. Europ J Oper Res 71, 366\u2013378 (1993)","journal-title":"Europ J Oper Res"},{"key":"345_CR16","doi-asserted-by":"publisher","unstructured":"Qiang, Zhang., Weiwei, Wu., Minming, Li.: Resource scheduling with supply constraint and linear cost. COCOA 2012 conference (2012). doi:\n                    10.1007\/3-540-68339-9_34","DOI":"10.1007\/3-540-68339-9_34"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0345-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0345-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0345-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T06:30:07Z","timestamp":1589697007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0345-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,19]]},"references-count":16,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["345"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0345-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2017,7,19]]},"assertion":[{"value":"25 September 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}