{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T22:32:57Z","timestamp":1777501977720,"version":"3.51.4"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030931759","type":"print"},{"value":"9783030931766","type":"electronic"}],"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-93176-6_9","type":"book-chapter","created":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T22:09:57Z","timestamp":1639692597000},"page":"96-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Single Machine Scheduling with\u00a0Rejection to\u00a0Minimize the\u00a0Weighted Makespan"],"prefix":"10.1007","author":[{"given":"Lingfa","family":"Lu","sequence":"first","affiliation":[]},{"given":"Liqi","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jinwen","family":"Ou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,17]]},"reference":[{"key":"9_CR1","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."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"1850048","DOI":"10.1142\/S0217595918500483","volume":"35","author":"X Chai","year":"2018","unstructured":"Chai, X., Lu, L.F., Li, W.H., Zhang, L.Q.: Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time. Asia-Pacific J. Oper. Res. 35, 1850048 (2018)","journal-title":"Asia-Pacific J. Oper. Res."},{"issue":"4","key":"9_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":"9_CR4","first-page":"121","volume":"11","author":"Q Feng","year":"2007","unstructured":"Feng, Q., Yuan, J.J.: NP-hardness of a multicriteria scheduling on two families of jobs. OR Trans. 11, 121\u2013126 (2007)","journal-title":"OR Trans."},{"key":"9_CR5","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, CA (1979)"},{"key":"9_CR6","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":"9_CR7","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10107-002-0324-z","volume":"94","author":"H Hoogeveen","year":"2003","unstructured":"Hoogeveen, H., Skutella, M., Woeginger, G.J.: Preemptive scheduling with rejection. Math. Program. 94, 361\u2013374 (2003)","journal-title":"Math. Program."},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"1550030","DOI":"10.1142\/S021759591550030X","volume":"32","author":"WJ Li","year":"2015","unstructured":"Li, W.J.: A best possible online algorithm for the parallel-machine scheduling to minimize the maximum weighted completed time. Asia-Pacific J. Oper. Res. 32, 1550030 (2015)","journal-title":"Asia-Pacific J. Oper. Res."},{"issue":"4","key":"9_CR9","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":"9_CR10","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":"9_CR11","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 Peeling Onion 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":"9_CR12","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."},{"issue":"6","key":"9_CR13","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s10951-021-00697-4","volume":"24","author":"B Mor","year":"2021","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. 24(6), 553\u2013567 (2021). https:\/\/doi.org\/10.1007\/s10951-021-00697-4","journal-title":"J. Sched."},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0166-218X(90)90105-L","volume":"26","author":"E Nowicki","year":"1990","unstructured":"Nowicki, E., Zdrzalka, S.: A survey of results for sequencing problems with controllable processing times. Discret. Appl. Math. 26, 271\u2013287 (1990)","journal-title":"Discret. Appl. Math."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Oron, D.: Two-agent scheduling problems under rejection budget constraints. Omega 102, 102313 (2021)","DOI":"10.1016\/j.omega.2020.102313"},{"key":"9_CR16","unstructured":"Schuurman, P., Woeginger, G.J.: Approximation Schemes - A Tutorial. Lectures on Scheduling, LA Wolsey (2009)"},{"key":"9_CR17","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":"9_CR18","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D Shabtay","year":"2007","unstructured":"Shabtay, D., Steiner, G.: A survey of scheduling with controllable processing times. Discret. Appl. Math. 155, 1643\u20131666 (2007)","journal-title":"Discret. Appl. Math."},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/S0377-2217(82)80008-8","volume":"11","author":"LN Van Wassenhove","year":"1982","unstructured":"Van Wassenhove, L.N., Baker, K.R.: A bicriterion approach to time\/cost trade-offs in sequencing. Eur. J. Oper. Res. 11, 48\u201354 (1982)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","volume":"12","author":"GJ Woeginger","year":"2000","unstructured":"Woeginger, G.J.: When does a dynamic programming formulation guarantee the exitence of an FPTAS? INFORMS J. Comput. 12, 57\u201374 (2000)","journal-title":"INFORMS J. Comput."},{"key":"9_CR21","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."},{"issue":"2","key":"9_CR22","first-page":"111","volume":"24","author":"YZ Zhang","year":"2020","unstructured":"Zhang, Y.Z.: A survey on job scheduling with rejection (in Chinese). OR Trans. 24(2), 111\u2013130 (2020)","journal-title":"OR Trans."}],"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-030-93176-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T05:45:14Z","timestamp":1641015914000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93176-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030931759","9783030931766"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93176-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 December 2021","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 Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 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":"aaim2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2021\/","order":11,"name":"conference_url","label":"Conference URL","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":"OCS","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":"38","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":"61% - 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":"3","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)"}}]}}