{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:16:18Z","timestamp":1743038178299,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":13,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819777518"},{"type":"electronic","value":"9789819777525"}],"license":[{"start":{"date-parts":[[2024,12,29]],"date-time":"2024-12-29T00:00:00Z","timestamp":1735430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,29]],"date-time":"2024-12-29T00:00:00Z","timestamp":1735430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-97-7752-5_9","type":"book-chapter","created":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T10:06:45Z","timestamp":1735380405000},"page":"115-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling Two Types of\u00a0Jobs with\u00a0Minimum Makespan"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1760-3820","authenticated-orcid":false,"given":"Song","family":"Cao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3720-5117","authenticated-orcid":false,"given":"Kai","family":"Jin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,29]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: algorithms and complexity. In: Handbooks in Operations Research and Management Science, vol. 4, pp. 445\u2013522 (1993)","DOI":"10.1016\/S0927-0507(05)80189-6"},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"MR Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: \u201cStrong\u2019\u2019 np-completeness results: motivation, examples, and implications. J. ACM (JACM) 25(3), 499\u2013508 (1978)","journal-title":"J. ACM (JACM)"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"JK Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46, 259\u2013271 (1990)","journal-title":"Math. Program."},{"issue":"2","key":"9_CR4","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.ejor.2004.04.015","volume":"165","author":"M Ghirardi","year":"2005","unstructured":"Ghirardi, M., Potts, C.N.: Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach. Eur. J. Oper. Res. 165(2), 457\u2013467 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR5","unstructured":"Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling. In: SODA, pp. 493\u2013500. Citeseer (1997)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Azar, Y., Epstein, A.: Convex programming for scheduling unrelated parallel machines. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 331\u2013337 (2005)","DOI":"10.1145\/1060590.1060639"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Kumar, V.S.A., Marathe, M.V.: Approximation algorithms for scheduling on multiple machines. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), pp. 254\u2013263. IEEE (2005)","DOI":"10.1109\/SFCS.2005.21"},{"key":"9_CR8","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: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 138\u2013147. IEEE (2016)","DOI":"10.1109\/FOCS.2016.23"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Bhaskara, A., Krishnaswamy, R., Talwar, K., Wieder, U.: Minimum makespan scheduling with low rank processing times. In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 937\u2013947. SIAM (2013)","DOI":"10.1137\/1.9781611973105.67"},{"key":"9_CR10","unstructured":"Chen, L., Marx, D., Ye, D., Zhang, G.: Parameterized and approximation results for scheduling with a low rank processing time matrix. In: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Schloss-Dagstuhl-Leibniz Zentrum f\u00fcr Informatik (2017)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Deng, S., Li, J., Rabani, Y.: Generalized unrelated machine scheduling problem. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2898\u20132916. SIAM (2023)","DOI":"10.1137\/1.9781611977554.ch110"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Bamas, \u00c9., Lindermayr, A., Megow, N., Rohwedder, L., Schl\u00f6ter, J.: Santa Claus meets makespan and matroids: algorithms and reductions. In: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2829\u20132860. SIAM (2024)","DOI":"10.1137\/1.9781611977912.100"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Cao, S., Jin, K.: Scheduling two types of jobs with minimum makespan (2024)","DOI":"10.1007\/978-981-97-7752-5_9"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7752-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T20:23:50Z","timestamp":1739305430000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7752-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,29]]},"ISBN":["9789819777518","9789819777525"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7752-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,29]]},"assertion":[{"value":"29 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijtcs2024.comp.polyu.edu.hk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}