{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:46:46Z","timestamp":1740098806447,"version":"3.37.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319530062"},{"type":"electronic","value":"9783319530079"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53007-9_21","type":"book-chapter","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T05:13:23Z","timestamp":1486012403000},"page":"230-241","source":"Crossref","is-referenced-by-count":0,"title":["Structured Instances of Restricted Assignment with Two Processing Times"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Rohwedder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,26]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Khanna, S.: A special case of restricted assignment makespan minimization. In: 11th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP) (2013)","DOI":"10.1137\/1.9781611973730.73"},{"key":"21_CR2","unstructured":"Chakrabarty, D., Khanna, S., Li, S.: On $$(1, \\epsilon )$$ ( 1 , \u03f5 ) -restricted assignment makespan minimization. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, pp. 1087\u20131101. SIAM (2015). http:\/\/dl.acm.org\/citation.cfm?id=2722129.2722202"},{"key":"21_CR3","unstructured":"Ebenlendr, T., Kr\u010d\u00e1l, M., Sgall, J.: Graph balancing: a special case of scheduling unrelated parallel machines. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp. 483\u2013490 (2008). http:\/\/dl.acm.org\/citation.cfm?id=1347082.1347135"},{"key":"21_CR4","unstructured":"Huang, C., Ott, S.: A combinatorial approximation algorithm for graph balancing with light hyper edges. In: 24th Annual European Symposium on Algorithms, ESA 2016, 22\u201324 August 2016, pp. 49:1\u201349:15, Aarhus, Denmark (2016). http:\/\/dx.doi.org\/10.4230\/LIPIcs.ESA.2016.49"},{"key":"21_CR5","unstructured":"Jansen, K., Land, K., Maack, M.: Estimating the makespan of the two-valued restricted assignment problem. In: 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, 22\u201324 June 2016, Reykjavik, Iceland, pp. 24:1\u201324:13 (2016). http:\/\/dx.doi.org\/10.4230\/LIPIcs.SWAT.2016.24"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Jansen, K., Rohwedder, L.: On the configuration-LP of the restricted assignment problem. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, 16\u201319 January 2017 (2017, to appear)","DOI":"10.1137\/1.9781611974782.176"},{"issue":"3","key":"21_CR7","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"JK Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46(3), 259\u2013271 (1990). http:\/\/dx.doi.org\/10.1007\/BF01585745","journal-title":"Math. Program."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Svensson, O.: Santa claus schedules jobs on unrelated machines. In: Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, STOC 2011, pp. 617\u2013626. ACM, New York (2011). http:\/\/doi.acm.org\/10.1145\/1993636.1993718","DOI":"10.1145\/1993636.1993718"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53007-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T01:39:09Z","timestamp":1568770749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53007-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319530062","9783319530079"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53007-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}