{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:23:43Z","timestamp":1743157423831,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-92681-6_20","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"234-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Single Machine Scheduling with\u00a0Rejection and\u00a0Generalized Parameters"],"prefix":"10.1007","author":[{"given":"Xue","family":"Yu","sequence":"first","affiliation":[]},{"given":"Lingfa","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Liqi","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s11590-016-1059-8","volume":"11","author":"A Agnetis","year":"2017","unstructured":"Agnetis, A., Mosheiov, G.: Scheduling with job rejection and position-dependent processing times on proportionate flowshops. Optim. Lett. 11, 885\u2013892 (2017)","journal-title":"Optim. Lett."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y Bartal","year":"2000","unstructured":"Bartal, Y., Leonardi, S., Spaccamela, A.M., Stougie, J.: Multi-processor scheduling with rejection. SIAM J. Discret. Math. 13, 64\u201378 (2000)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"20_CR3","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1007\/s10878-020-00649-2","volume":"40","author":"R-X Chen","year":"2020","unstructured":"Chen, R.-X., Li, S.-S.: Minimizing maximum delivery completion time for order scheduling with rejection. J. Comb. Optim. 40(4), 1044\u20131064 (2020). https:\/\/doi.org\/10.1007\/s10878-020-00649-2","journal-title":"J. Comb. Optim."},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"JZ Du","year":"1990","unstructured":"Du, J.Z., Leung, J.Y.T.: Minimizing total tardiness on one machine is NP-hard. Math. Oper. Res. 15, 483\u2013495 (1990)","journal-title":"Math. Oper. Res."},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.dam.2015.03.011","volume":"189","author":"Y Gao","year":"2015","unstructured":"Gao, Y., Yuan, J.J.: Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates. Discret. Appl. Math. 189, 49\u201352 (2015)","journal-title":"Discret. Appl. Math."},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.orl.2015.12.006","volume":"44","author":"Y Gao","year":"2016","unstructured":"Gao, Y., Yuan, J.J.: Unary NP-hardness of minimizing total weighted tardiness with generalized due dates. Oper. Res. Lett. 44, 92\u201395 (2016)","journal-title":"Oper. Res. Lett."},{"key":"20_CR7","volume-title":"Computers and Intractablity: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractablity: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"3164","DOI":"10.1080\/00207543.2016.1266055","volume":"55","author":"E Gerstl","year":"2017","unstructured":"Gerstl, E., Mosheiov, G.: Single machine scheduling problems with generalized due-dates and job-rejection. Int. J. Prod. Res. 55, 3164\u20133172 (2017)","journal-title":"Int. J. Prod. Res."},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1080\/07408178608975351","volume":"18","author":"NG Hall","year":"1986","unstructured":"Hall, N.G.: Scheduling problems with generalized due dates. IIE Trans. 18, 220\u2013222 (1986)","journal-title":"IIE Trans."},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/0377-2217(91)90149-P","volume":"51","author":"NG Hall","year":"1991","unstructured":"Hall, N.G., Sethi, S.P., Srikandarajah, S.: On the complexity of generalized due date scheduling problems. Eur. J. Oper. Res. 51, 100\u2013109 (1991)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ejor.2018.07.038","volume":"273","author":"D Hermelin","year":"2019","unstructured":"Hermelin, D., Pinedo, M., Shabtay, D., Talmon, N.: On the parameterized tractability of a single machine scheduling with rejection. Eur. J. Oper. Res. 273, 67\u201373 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","volume":"19","author":"EL Lawer","year":"1973","unstructured":"Lawer, E.L.: Optimal sequencing a single machine subject to precedence constraints. Manage. Sci. 19, 544\u2013546 (1973)","journal-title":"Manage. Sci."},{"issue":"4","key":"20_CR14","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/s10878-020-00642-9","volume":"40","author":"P Liu","year":"2020","unstructured":"Liu, P., Lu, X.: New approximation algorithms for machine scheduling with rejection on single and parallel machine. J. Comb. Optim. 40(4), 929\u2013952 (2020). https:\/\/doi.org\/10.1007\/s10878-020-00642-9","journal-title":"J. Comb. Optim."},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.orl.2020.06.006","volume":"48","author":"ZX Liu","year":"2020","unstructured":"Liu, Z.X.: Scheduling with partial rejection. Oper. Res. Lett. 48, 524\u2013529 (2020)","journal-title":"Oper. Res. Lett."},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"1950033","DOI":"10.1142\/S0217595919500337","volume":"37","author":"LF Lu","year":"2020","unstructured":"Lu, L.F., Zhang, L.Q., Zhang, J., Zuo, L.L.: Single machine scheduling with outsourcing under different fill rates or quantity discount rates. Asia-Pacific J. Oper. Res. 37, 1950033 (2020)","journal-title":"Asia-Pacific J. Oper. Res."},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10479-018-2866-3","volume":"298","author":"LF Lu","year":"2021","unstructured":"Lu, L.F., Zhang, L.Q., Ou, J.W.: In-house production and outsourcing under different discount schemes on the total outsourcing cost. Ann. Oper. Res. 298, 361\u2013374 (2021)","journal-title":"Ann. Oper. Res."},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ejor.2020.08.009","volume":"290","author":"R Ma","year":"2021","unstructured":"Ma, R., Guo, S.N.: Applying \u201cPeeling Onion\u2019\u2019 approach for competitive analysis in online scheduling with rejection. Eur. J. Oper. Res. 290, 57\u201367 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"20_CR19","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s10951-019-00612-y","volume":"23","author":"B Mor","year":"2019","unstructured":"Mor, B., Mosheiov, G., Shapira, D.: Flowshop scheduling with learning effect and job rejection. J. Sched. 23(6), 631\u2013641 (2019). https:\/\/doi.org\/10.1007\/s10951-019-00612-y","journal-title":"J. Sched."},{"key":"20_CR20","doi-asserted-by":"publisher","unstructured":"Mor B., Mosheiov G., Shabtay D.: Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates. J. Sched. (2021). https:\/\/doi.org\/10.1007\/s10951-021-00697-4","DOI":"10.1007\/s10951-021-00697-4"},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1016\/S0305-0548(03)00018-2","volume":"31","author":"G Mosheiov","year":"2004","unstructured":"Mosheiov, G., Oron, D.: A note on the SPT heuristic for solving scheduling problems with generalized due dates. Comput. Oper. Res. 31, 645\u2013655 (2004)","journal-title":"Comput. Oper. Res."},{"key":"20_CR22","doi-asserted-by":"publisher","first-page":"837C846","DOI":"10.1016\/j.ejor.2020.12.061","volume":"293","author":"G Mosheiov","year":"2021","unstructured":"Mosheiov, G., Oron, D., Shabtay, D.: Minimizing total late work on a single machine with generalized due-dates. Eur. J. Oper. Res. 293, 837C846 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2020.102313","volume":"102","author":"D Oron","year":"2021","unstructured":"Oron, D.: Two-agent scheduling problems under rejection budget constraints. Omega 102, 102313 (2021)","journal-title":"Omega"},{"key":"20_CR24","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 off-line scheduling with rejection. J. Sched. 16, 3\u201328 (2013)","journal-title":"J. Sched."},{"key":"20_CR25","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1002\/1520-6750(199008)37:4<587::AID-NAV3220370411>3.0.CO;2-O","volume":"37","author":"S Srikandarajah","year":"1990","unstructured":"Srikandarajah, S.: A note on the generalized due dates scheduling problem. Nav. Res. Logist. 37, 587\u2013597 (1990)","journal-title":"Nav. Res. Logist."},{"key":"20_CR26","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1023\/A:1018987625819","volume":"86","author":"K Tanaka","year":"1999","unstructured":"Tanaka, K., Vlach, M.: Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine. Ann. Oper. Res. 86, 507\u2013526 (1999)","journal-title":"Ann. Oper. Res."},{"key":"20_CR27","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.omega.2018.04.008","volume":"81","author":"DJ Wang","year":"2018","unstructured":"Wang, D.J., Yin, Y.Q., Jin, Y.: Parallel-machine rescheduling with job unavailability and rejection. Omega 81, 246\u2013260 (2018)","journal-title":"Omega"},{"key":"20_CR28","first-page":"1674","volume":"219","author":"YQ Yin","year":"2012","unstructured":"Yin, Y.Q., Cheng, S.R., Cheng, T.C.E., Wu, C.C., Wu, W.H.: Two-agent single-machine scheduling with assignable due dates. Appl. Math. Comput. 219, 1674\u20131685 (2012)","journal-title":"Appl. Math. Comput."},{"key":"20_CR29","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, 975\u2013978 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2020.100609","volume":"38","author":"J Zou","year":"2020","unstructured":"Zou, J., Yuan, J.J.: Single-machine scheduling with maintenance activities and rejection. Discret. Optim. 38, 100609 (2020)","journal-title":"Discret. 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-3-030-92681-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:05:26Z","timestamp":1639353926000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Tianjin","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","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":"16","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":"8","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":"26% - 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":"4.2","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.75","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)"}}]}}