{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T04:36:51Z","timestamp":1778733411524,"version":"3.51.4"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030046170","type":"print"},{"value":"9783030046187","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04618-7_3","type":"book-chapter","created":{"date-parts":[[2018,11,16]],"date-time":"2018-11-16T20:47:58Z","timestamp":1542401278000},"page":"24-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Makespan Minimization on Unrelated Parallel Machines with a Few Bags"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6317-7431","authenticated-orcid":false,"given":"Daniel R.","family":"Page","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Solis-Oba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,17]]},"reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/s10878-009-9276-z","volume":"22","author":"Y Asahiro","year":"2011","unstructured":"Asahiro, Y., Jansson, J., Miyano, E., Ono, H., Zenmyo, K.: Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. J. Comb. Optim. 22(1), 78\u201396 (2011)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0166-218X(94)90009-4","volume":"55","author":"H Bodlaender","year":"1994","unstructured":"Bodlaender, H., Jansen, K., Woeginger, G.: Scheduling with incompatible jobs. Discret. Appl. Math. 55(3), 219\u2013232 (1994)","journal-title":"Discret. Appl. Math."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Khanna, S., Li, S.: On (1, $$\\varepsilon $$)-restricted assignment makespan minimization. In: 26th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1087\u20131101 (2015)","DOI":"10.1137\/1.9781611973730.73"},{"key":"3_CR4","unstructured":"Das, S., Wiese, A.: On minimizing the makespan when some jobs cannot be assigned on the same machine. In: 24th Annual European Symposium on Algorithms, LIPIcs, vol. 87, pp. 31:1\u201331:14 (2017)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.orl.2012.04.003","volume":"40","author":"T Dokka","year":"2012","unstructured":"Dokka, T., Kouvela, A., Spieksma, F.: Approximating the multi-level bottleneck assignment problem. Oper. Res. Lett. 40, 282\u2013286 (2012)","journal-title":"Oper. Res. Lett."},{"key":"3_CR6","unstructured":"Ebenlendr, T., Kr\u010d\u00e1l, M., Sgall, J.: Graph balancing: a special case of scheduling unrelated parallel machines. In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 483\u2013490 (2008)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-15775-2_2","volume-title":"Algorithms \u2013 ESA 2010","author":"F Eisenbrand","year":"2010","unstructured":"Eisenbrand, F.: Solving an avionics real-time scheduling problem by advanced IP-methods. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6346, pp. 11\u201322. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15775-2_2"},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.tcs.2007.02.056","volume":"380","author":"M Gairing","year":"2007","unstructured":"Gairing, M., Monien, B., Woclaw, A.: A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theor. Comput. Sci. 380(1), 87\u201399 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR9","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-completeness (1979)"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1142\/S0129054118410071","volume":"29","author":"J Gehrke","year":"2018","unstructured":"Gehrke, J., Jansen, K., Kraft, S., Schikowski, J.: A PTAS for scheduling unrelated machines of few different types. Int. J. Found. Comput. Sci. 29, 591\u2013621 (2018)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"3_CR11","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., Rinnooy, K.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discret. Math."},{"key":"3_CR12","unstructured":"Huang, C., Ott, S.: A combinatorial approximation algorithm for graph balancing with light hyper edges. In: 24th Annual European Symposium on Algorithms, LIPIcs, vol. 57, pp. 49:1\u201349:15 (2016)"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-319-62127-2_42","volume-title":"Algorithms and Data Structures","author":"K Jansen","year":"2017","unstructured":"Jansen, K., Maack, M.: An EPTAS for scheduling on unrelated machines of few different types. Algorithms and Data Structures. LNCS, vol. 10389, pp. 497\u2013508. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_42"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-319-59250-3_25","volume-title":"Integer Programming and Combinatorial Optimization","author":"K Jansen","year":"2017","unstructured":"Jansen, K., Rohwedder, L.: A quasi-polynomial approximation for the restricted assignment problem. In: Eisenbrand, F., Koenemann, J. (eds.) IPCO 2017. LNCS, vol. 10328, pp. 305\u2013316. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59250-3_25"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ipl.2012.09.004","volume":"113","author":"S Kolliopoulos","year":"2013","unstructured":"Kolliopoulos, S., Moysoglou, Y.: The 2-valued case of makespan minimization with assignment constraints. Inf. Process. Lett. 113(1), 39\u201343 (2013)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20133","key":"3_CR16","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J Lenstra","year":"1990","unstructured":"Lenstra, J., Shmoys, D., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46(1\u20133), 259\u2013271 (1990)","journal-title":"Math. Program."},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0377-2217(02)00914-1","volume":"156","author":"Y Lin","year":"2004","unstructured":"Lin, Y., Li, W.: Parallel machine scheduling of machine-dependent jobs with unit-length. Eur. J. Oper. Res. 156(1), 261\u2013266 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"3_CR18","doi-asserted-by":"publisher","first-page":"38","DOI":"10.3390\/a9020038","volume":"9","author":"D Page","year":"2016","unstructured":"Page, D., Solis-Oba, R.: A 3\/2-approximation algorithm for the graph balancing problem with two weights. Algorithms 9(2), 38 (2016)","journal-title":"Algorithms"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.orl.2004.05.004","volume":"33","author":"E Shchepin","year":"2005","unstructured":"Shchepin, E., Vakhania, N.: An optimal rounding gives a better approximation for scheduling unrelated machines. Oper. Res. Lett. 33, 127\u2013133 (2005)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04618-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:57:38Z","timestamp":1710338258000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04618-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046170","9783030046187"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04618-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"3 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aaim2018.wordpress.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}