{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:30:51Z","timestamp":1742949051222,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":25,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819778003"},{"type":"electronic","value":"9789819778010"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-7801-0_3","type":"book-chapter","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:05:37Z","timestamp":1726769137000},"page":"27-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for\u00a0the\u00a0Constrained Assignment Problems with\u00a0Bounds and\u00a0Maximum Penalty"],"prefix":"10.1007","author":[{"given":"Guojun","family":"Hu","sequence":"first","affiliation":[]},{"given":"Pengxiang","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Junran","family":"Lichen","sequence":"additional","affiliation":[]},{"given":"Lijian","family":"Cai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,19]]},"reference":[{"issue":"1","key":"3_CR1","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 Discret. Math. 13(1), 64\u201378 (2000)","journal-title":"SIAM Discret. Math."},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0196-6774(03)00078-6","volume":"49","author":"DW Engels","year":"2003","unstructured":"Engels, D.W., Karger, D.R., Kolliopoulos, S.G., Sengupta, S., Uma, R.N., Wein, J.: Techniques for scheduling with rejection. J. Algorithms 49(1), 175\u2013191 (2003)","journal-title":"J. Algorithms"},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/j.ejor.2023.05.040","volume":"311","author":"M Gaggero","year":"2023","unstructured":"Gaggero, M., Paolucci, M., Ronco, R.: Exact and heuristic solution approaches for energy-efficient identical parallel machine scheduling with time-of-use costs. Eur. J. Oper. Res. 311(3), 845\u2013866 (2023)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Gao, Y., Yuan, J.J., Ng, C.T., Cheng, T.C.E.: Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost. 4OR-Q. J. Oper. Res. 20(2), 273\u2013287 (2022)","DOI":"10.1007\/s10288-021-00480-3"},{"issue":"3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/s40305-022-00403-x","volume":"11","author":"ZC Geng","year":"2023","unstructured":"Geng, Z.C., Zhang, Y.: Single-machine preemptive scheduling with release dates involving the total weighted late work criterion. J. Oper. Res. Soc. China 11(3), 693\u2013706 (2023)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.ejor.2004.07.011","volume":"167","author":"H Hoogeveen","year":"2005","unstructured":"Hoogeveen, H.: Multicriteria scheduling. Eur. J. Oper. Res. 167(3), 592\u2013623 (2005)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"3_CR7","doi-asserted-by":"publisher","first-page":"3259","DOI":"10.1109\/TC.2023.3290494","volume":"72","author":"TX Ji","year":"2023","unstructured":"Ji, T.X., Wan, X.L., Guan, X.J., Zhu, A.C., Ye, F.: Towards optimal application offloading in heterogeneous edge-cloud computing. IEEE Trans. Comput. 72(11), 3259\u20133272 (2023)","journal-title":"IEEE Trans. Comput."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"71481","DOI":"10.1109\/ACCESS.2022.3187701","volume":"10","author":"H Jin","year":"2022","unstructured":"Jin, H., Gregory, M.A., Li, S.: A review of intelligent computation offloading in multiaccess edge computing. IEEE Access 10, 71481\u201371495 (2022)","journal-title":"IEEE Access"},{"issue":"7","key":"3_CR9","doi-asserted-by":"publisher","first-page":"3025","DOI":"10.1007\/s00453-019-00566-9","volume":"81","author":"I Kones","year":"2019","unstructured":"Kones, I., Levin, A.: A unified framework for designing EPTAS for load balancing on parallel machines. Algorithmica 81(7), 3025\u20133046 (2019)","journal-title":"Algorithmica"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10951-020-00671-6","volume":"24","author":"C Koulamas","year":"2021","unstructured":"Koulamas, C., Steiner, G.: New results for scheduling to minimize tardiness on one machine with rejection and related problems. J. Sched. 24(1), 27\u201334 (2021)","journal-title":"J. Sched."},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.ejor.2013.01.027","volume":"228","author":"SO Krumke","year":"2013","unstructured":"Krumke, S.O., Thielen, C.: The generalized assignment problem with minimum quantities. Eur. J. Oper. Res. 228(1), 46\u201355 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR12","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. Nav. Res. Logist. Q. 2, 83\u201397 (1955)","journal-title":"Nav. Res. Logist. Q."},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1016\/j.ejor.2005.03.020","volume":"174","author":"WH Kuo","year":"2006","unstructured":"Kuo, W.H., Yang, D.L.: Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect. Eur. J. Oper. Res. 174(2), 1184\u20131190 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1016\/j.apm.2020.07.048","volume":"89","author":"AA Lazarev","year":"2021","unstructured":"Lazarev, A.A., Lemtyuzhnikova, D.V., Werner, F.: A metric approach for scheduling problems with minimizing the maximum penalty. Appl. Math. Model. 89, 1163\u20131176 (2021)","journal-title":"Appl. Math. Model."},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Li, W.D., Li, J.P., Zhang, X.J., Chen, Z.B.: Penalty cost constrained identical parallel machine scheduling problem. Theor. Comput. Sci. 607(part 2), 181\u2013192 (2015)","DOI":"10.1016\/j.tcs.2015.10.007"},{"issue":"3","key":"3_CR16","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1016\/j.ejor.2023.11.002","volume":"314","author":"WD Li","year":"2024","unstructured":"Li, W.D., Ou, J.W.: Machine scheduling with restricted rejection: an application to task offloading in cloud-edge collaborative computing. Eur. J. Oper. Res. 314(3), 912\u2013919 (2024)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"3_CR17","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10878-023-01032-7","volume":"45","author":"XF Liu","year":"2023","unstructured":"Liu, X.F., Xiao, M., Li, W.D., Zhu, Y.Y., Ma, L.: Algorithms for single machine scheduling problem with release dates and submodular penalties. J. Comb. Optim. 45(4), 105 (2023)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"3_CR18","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."},{"issue":"2","key":"3_CR19","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.ejor.2005.09.014","volume":"176","author":"DW Pentico","year":"2007","unstructured":"Pentico, D.W.: Assignment problems: a golden anniversary survey. Eur. J. Oper. Res. 176(2), 774\u2013793 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR20","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer-Verlag, Berlin (2003)"},{"issue":"1","key":"3_CR21","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(1), 3\u201328 (2013)","journal-title":"J. Sched."},{"issue":"3","key":"3_CR22","doi-asserted-by":"publisher","first-page":"7061","DOI":"10.3934\/math.2023356","volume":"8","author":"N Vakhania","year":"2023","unstructured":"Vakhania, N.: On preemptive scheduling on unrelated machines using linear programming. AIMS Math. 8(3), 7061\u20137082 (2023)","journal-title":"AIMS Math."},{"key":"3_CR23","unstructured":"Votaw, D.F., Orden, A.: The personnel assignment problem. In: Symposium on Linear Inequalities and Programming, SCOOP 10, US Air Force, pp. 155\u2013163 (1952)"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, L.Q., Lu, L.F.: Parallel-machine scheduling with release dates and rejection. 4OR-Q. J. Oper. Res. 14(2), 165\u2013172 (2016)","DOI":"10.1007\/s10288-016-0304-4"},{"issue":"1","key":"3_CR25","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/s10878-016-0044-6","volume":"35","author":"XZ Zhang","year":"2018","unstructured":"Zhang, X.Z., Xu, D.C., Du, D.L., Wu, C.C.: Approximation algorithms for precedence-constrained identical machine scheduling with rejection. J. Comb. Optim. 35(1), 318\u2013330 (2018)","journal-title":"J. Comb. Optim."}],"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-981-97-7801-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:07:46Z","timestamp":1726769266000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7801-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819778003","9789819778010"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7801-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"19 September 2024","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 Aspects in Information and 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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 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":"aaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2024\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}