{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T10:10:09Z","timestamp":1746439809758,"version":"3.40.4"},"publisher-location":"Singapore","reference-count":19,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819644445","type":"print"},{"value":"9789819644452","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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-96-4445-2_37","type":"book-chapter","created":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:34:15Z","timestamp":1746437655000},"page":"453-464","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling on Parallel-batch Machines with Rejection and Resource Matching"],"prefix":"10.1007","author":[{"given":"Wenhua","family":"Li","sequence":"first","affiliation":[]},{"given":"Liang","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Ran","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Shisheng","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,6]]},"reference":[{"issue":"2","key":"37_CR1","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1007\/s10878-014-9787-0","volume":"31","author":"M Barketau","year":"2016","unstructured":"Barketau, M., Pesch, E., Shafransky, Y.: Scheduling dedicated jobs with variative processing times. J. Comb. Optim. 31(2), 774\u2013785 (2016)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"37_CR2","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y Bartal","year":"2000","unstructured":"Bartal, Y., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., Stougie, L.: Multiprocessor scheduling with rejection. SIAM J. Discret. Math. 13(1), 64\u201378 (2000)","journal-title":"SIAM J. Discret. Math."},{"issue":"27\u201329","key":"37_CR3","doi-asserted-by":"publisher","first-page":"2732","DOI":"10.1016\/j.tcs.2009.04.006","volume":"410","author":"ZG Cao","year":"2009","unstructured":"Cao, Z.G., Yang, X.G.: A PTAS for parallel batch scheduling with rejection and dynamic job arrivals. Theoret. Comput. Sci. 410(27\u201329), 2732\u20132745 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"37_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco (1979)"},{"issue":"9","key":"37_CR5","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45(9), 1563\u20131581 (1966)","journal-title":"Bell Syst. Tech. J."},{"issue":"1\u20132","key":"37_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The hungarian method for the assignment problem. Naval Research Logistics Quarterly 2(1\u20132), 83\u201397 (1955)","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"37_CR7","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1080\/002075499192020","volume":"37","author":"C-Y Lee","year":"1999","unstructured":"Lee, C.-Y.: Minimizing makespan on a single batch processing machine with dynamic job arrivals. Int. J. Prod. Res. 37(1), 219\u2013236 (1999)","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"37_CR8","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/s10878-020-00642-9","volume":"40","author":"PH Liu","year":"2020","unstructured":"Liu, P.H., Lu, X.W.: New approximation algorithms for machine scheduling with rejection on single and parallel machine. J. Comb. Optim. 40(4), 929\u2013952 (2020)","journal-title":"J. Comb. Optim."},{"issue":"10","key":"37_CR9","doi-asserted-by":"publisher","first-page":"2748","DOI":"10.1016\/j.cor.2008.12.003","volume":"36","author":"LF Lu","year":"2009","unstructured":"Lu, L.F., Cheng, T.C.E., Yuan, J.J., Zhang, L.Q.: Bounded single-machine parallel-batch scheduling with release dates and rejection. Computers & Operations Research 36(10), 2748\u20132751 (2009)","journal-title":"Computers & Operations Research"},{"issue":"1\u20133","key":"37_CR10","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.tcs.2008.02.015","volume":"396","author":"LF Lu","year":"2008","unstructured":"Lu, L.F., Zhang, L.Q., Yuan, J.J.: The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan. Theoret. Comput. Sci. 396(1\u20133), 283\u2013289 (2008)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"37_CR11","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1016\/j.ejor.2023.04.019","volume":"310","author":"JW Ou","year":"2023","unstructured":"Ou, J.W., Lu, L.F., Zhong, X.L.: Parallel-batch scheduling with rejection: Structural properties and approximation algorithms. Eur. J. Oper. Res. 310(3), 1017\u20131032 (2023)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"37_CR12","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.ipl.2016.02.008","volume":"116","author":"JW Ou","year":"2016","unstructured":"Ou, J.W., Zhong, X.L., Li, C.-L.: Faster algorithms for single machine scheduling with release dates and rejection. Inf. Process. Lett. 116(8), 503\u2013507 (2016)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"37_CR13","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.ejor.2014.09.028","volume":"241","author":"JW Ou","year":"2015","unstructured":"Ou, J.W., Zhong, X.L., Wang, G.Q.: An improved heuristic for parallel machine scheduling with rejection. Eur. J. Oper. Res. 241(3), 653\u2013661 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"37_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","volume":"16","author":"D Shabtay","year":"2013","unstructured":"Shabtay, D., Gaspar, N., Kaspi, M.: A survey on offline scheduling with rejection. J. Sched. 16, 3\u201328 (2013)","journal-title":"J. Sched."},{"issue":"2","key":"37_CR15","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10288-016-0304-4","volume":"14","author":"LQ Zhang","year":"2016","unstructured":"Zhang, L.Q., Lu, L.F.: Parallel-machine scheduling with release dates and rejection. 4OR 14(2), 165\u2013172 (2016)","journal-title":"4OR"},{"issue":"3","key":"37_CR16","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1016\/j.ejor.2008.10.006","volume":"198","author":"LQ Zhang","year":"2009","unstructured":"Zhang, L.Q., Lu, L.F., Yuan, J.J.: Single machine scheduling with release dates and rejection. Eur. J. Oper. Res. 198(3), 975\u2013978 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"37_CR17","unstructured":"Y.\u00a0Z. Zhang. A survey on job scheduling with rejection. Operations Research Transactions, 24(2), 2020"},{"key":"37_CR18","doi-asserted-by":"crossref","unstructured":"X.\u00a0L. Zhong and J.\u00a0W. Ou. Improved approximation algorithms for parallel machine scheduling with release dates and job rejection. 4OR, 15:387\u2013406, 2017","DOI":"10.1007\/s10288-016-0339-6"},{"issue":"3","key":"37_CR19","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1007\/s10878-016-0016-x","volume":"33","author":"XL Zhong","year":"2017","unstructured":"Zhong, X.L., Pan, Z.M., Jiang, D.K.: Scheduling with release times and rejection on two parallel machines. J. Comb. Optim. 33(3), 934\u2013944 (2017)","journal-title":"J. Comb. Optim."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-4445-2_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:34:18Z","timestamp":1746437658000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-4445-2_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819644445","9789819644452"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-4445-2_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"6 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare that they have no known competing financial interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","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":"6 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cocoa2024.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}