{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:37:14Z","timestamp":1743003434242,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030218027"},{"type":"electronic","value":"9783030218034"}],"license":[{"start":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:00:00Z","timestamp":1560556800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-21803-4_107","type":"book-chapter","created":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T22:03:24Z","timestamp":1560549804000},"page":"1089-1096","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling Three Identical Parallel Machines with Capacity Constraints"],"prefix":"10.1007","author":[{"given":"Jian","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,15]]},"reference":[{"key":"107_CR1","unstructured":"Afrati, F., Bampis, E., Chekuri, C., Karger, D. et al.: Approximation schemes for minimizing average weighted completion time with release dates. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pp. 32\u201343 (1999)"},{"key":"107_CR2","doi-asserted-by":"crossref","unstructured":"Andersson, G.: An approximation algorithm for max \n                    \n                      \n                    \n                    $$p$$\n                  -section. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 237\u2013247","DOI":"10.1007\/3-540-49116-3_22"},{"key":"107_CR3","doi-asserted-by":"crossref","unstructured":"Bansal, N., Srinivasan, A., Svensson, O.: Lift-and-round to improve weighted completion time on unrelated machines. In: Proceedings of the 48th Annual ACM Symposium on Theory of Computing, pp. 156\u2013167 (2016)","DOI":"10.1145\/2897518.2897572"},{"key":"107_CR4","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Khanna, S.: A PTAS for minimizing weighted completion time on uniformly related machines. In: Proceedings of 28th International Colloquium on Automata, Languages, and Programming, pp. 848\u2013861. Springer, Berlin (2001)","DOI":"10.1007\/3-540-48224-5_69"},{"key":"107_CR5","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1016\/j.jcss.2003.07.012","volume":"68","author":"MX Goemans","year":"2004","unstructured":"Goemans, M.X., Williamson, D.P.: Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. J. Comput. Syst Sci. 68, 442\u2013470 (2004)","journal-title":"J. Comput. Syst Sci."},{"key":"107_CR6","doi-asserted-by":"crossref","unstructured":"Im, S., Li, S.: Better unrelated machine scheduling for weighted completion time via random offsets from non-uniform distributions. In: Proceedings of the 57th Annual Symposium on Foundations of Computer Science, pp. 138\u2013147 (2016)","DOI":"10.1109\/FOCS.2016.23"},{"key":"107_CR7","doi-asserted-by":"crossref","unstructured":"Kalaitzis, C., Svensson, O., Tarnawski, J.: Unrelated machine scheduling of jobs with uniform smith ratios. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2654\u20132669 (2017)","DOI":"10.1137\/1.9781611974782.175"},{"key":"107_CR8","doi-asserted-by":"crossref","unstructured":"Shmoys, D.B., Tardos, \u00c9.: An approximation algorithm for the generalized assignment problem. Math. Program. 62(1\u20133), 461\u2013474 (1993)","DOI":"10.1007\/BF01585178"},{"key":"107_CR9","unstructured":"Skutella, M.: Semidefinite relaxations for parallel machine scheduling. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pp. 472\u2013481 (1998)"},{"key":"107_CR10","doi-asserted-by":"crossref","unstructured":"Skutella, M.: Convex quadratic and semidefinite programming relaxations in scheduling. J. ACM 48(2), 206\u2013242 (2001)","DOI":"10.1145\/375827.375840"},{"key":"107_CR11","unstructured":"Skutella, M., Woeginger, G.J.: A PTAS for minimizing the total weighted completion time on identical parallel machines. Math. Oper. Res. 25(1), 63\u201375 (2000)"},{"key":"107_CR12","unstructured":"Yang, H., Ye, Y., Zhang, J.: An approximation algorithm for scheduling two parallel machines with capacity constraints. Discret. Appl. Math. 130(3), 449\u2013467 (2003)"}],"container-title":["Advances in Intelligent Systems and Computing","Optimization of Complex Systems: Theory, Models, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21803-4_107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T06:03:26Z","timestamp":1572588206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21803-4_107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,15]]},"ISBN":["9783030218027","9783030218034"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21803-4_107","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,6,15]]},"assertion":[{"value":"15 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WCGO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"World Congress on Global Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wcgo2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}