{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:15:03Z","timestamp":1743128103613,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031160806"},{"type":"electronic","value":"9783031160813"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16081-3_6","type":"book-chapter","created":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T22:02:24Z","timestamp":1663452144000},"page":"55-65","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On-line Single Machine Scheduling with\u00a0Release Dates and\u00a0Submodular Rejection Penalties"],"prefix":"10.1007","author":[{"given":"Xiaofei","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaoyu","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,18]]},"reference":[{"issue":"1","key":"6_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 J. Discrete Math. 13(1), 64\u201378 (2000)","journal-title":"SIAM J. Discrete Math."},{"issue":"12","key":"6_CR2","doi-asserted-by":"publisher","first-page":"2507","DOI":"10.1080\/00207160.2019.1711373","volume":"97","author":"B Dai","year":"2020","unstructured":"Dai, B., Li, W.: Vector scheduling with rejection on two machines. Int. J. Comput. Math. 97(12), 2507\u20132515 (2020)","journal-title":"Int. J. Comput. Math."},{"issue":"6","key":"6_CR3","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0167-6377(02)00160-8","volume":"30","author":"L Epstein","year":"2002","unstructured":"Epstein, L., Noga, J., Woeginger, G.: On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Oper. Res. Lett. 30(6), 415\u2013420 (2002)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0166-218X(02)00458-4","volume":"131","author":"L Fleischer","year":"2003","unstructured":"Fleischer, L., Iwata, S.: A push-relabel framework for submodular function minimization and applications to parametric optimization. Discrete Appl. Math. 131(2), 311\u2013322 (2003)","journal-title":"Discrete Appl. Math."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10288-017-0356-0","volume":"16","author":"W Li","year":"2018","unstructured":"Li, W., Cui, Q.: Vector scheduling with rejection on a single machine. 4OR 16, 95\u2013104 (2018)","journal-title":"4OR"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.tcs.2015.10.007","volume":"607","author":"W Li","year":"2015","unstructured":"Li, W., Li, J., Zhang, X., Chen, Z.: Penalty cost constrained identical parallel machine scheduling problem. Theor. Comput. Sci. 607, 181\u2013192 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.3390\/math8010133","volume":"8","author":"X Liu","year":"2020","unstructured":"Liu, X., Li, W.: Approximation algorithm for the single machine scheduling problem with release dates and submodular rejection penalty. Mathematics 8(1), 133 (2020)","journal-title":"Mathematics"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"2165","DOI":"10.1007\/s11590-021-01724-1","volume":"15","author":"X Liu","year":"2021","unstructured":"Liu, X., Li, W.: Approximation algorithms for the multiprocessor scheduling with submodular penalties. Optimiz. Lett. 15, 2165\u20132180 (2021)","journal-title":"Optimiz. Lett."},{"issue":"16","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1965","DOI":"10.3390\/math9161965","volume":"9","author":"X Liu","year":"2021","unstructured":"Liu, X., Li, W., Zhu, Y.: Single machine vector scheduling with general penalties. Mathematics 9(16), 1965 (2021)","journal-title":"Mathematics"},{"issue":"6","key":"6_CR10","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1360\/SSI-2021-0445","volume":"52","author":"X Liu","year":"2022","unstructured":"Liu, X., Dai, H., Li, S., Li, W.: $$k$$-prize-collecting minimum power cover problem with submodular penalties on a plane (in chinese). Sci. Sin. Inform. 52(6), 947 (2022)","journal-title":"Sci. Sin. Inform."},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.ijpe.2010.12.003","volume":"130","author":"L Lu","year":"2011","unstructured":"Lu, L., Ng, C., Zhang, L.: Optimal algorithms for single-machine scheduling with rejection to minimize the Makespan. Int. J. Prod. Econ. 130(2), 153\u2013158 (2011)","journal-title":"Int. J. Prod. Econ."},{"issue":"3","key":"6_CR12","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.ejor.2014.09.028","volume":"241","author":"J Ou","year":"2015","unstructured":"Ou, J., Zhong, X., Wang, G.: 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":"1\u20132","key":"6_CR13","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/S0304-3975(00)00288-7","volume":"262","author":"S Seiden","year":"2001","unstructured":"Seiden, S.: Preemptive multiprocessor scheduling with rejection. Theor. Comput. Sci. 262(1\u20132), 437\u2013458 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1016\/j.ejor.2008.10.006","volume":"198","author":"L Zhang","year":"2009","unstructured":"Zhang, L., Lu, L., Yuan, 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":"6_CR15","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/s10878-016-0044-6","volume":"35","author":"X Zhang","year":"2018","unstructured":"Zhang, X., Xu, D., Du, D., Wu, C.: Approximation algorithms for precedence-constrained identical machine scheduling with rejection. J. Combinat. Optimiz. 35, 318\u2013330 (2018)","journal-title":"J. Combinat. Optimiz."}],"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-031-16081-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T22:02:59Z","timestamp":1663452179000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16081-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031160806","9783031160813"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16081-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"18 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer Nature EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}