{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:17:50Z","timestamp":1743139070828,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_20","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"220-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Single Machine Scheduling with\u00a0Rejection to\u00a0Minimize the\u00a0k-th Power of\u00a0the\u00a0Makespan"],"prefix":"10.1007","author":[{"given":"Liqi","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Lingfa","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"20_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. Discrete Math. 13, 64\u201378 (2000)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"20_CR2","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_CR3","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, 175\u2013191 (2003)","journal-title":"J. Algorithms"},{"key":"20_CR4","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.J.: On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Oper. Res. Lett. 30, 415\u2013420 (2002)","journal-title":"Oper. Res. Lett."},{"key":"20_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 (1979)"},{"key":"20_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":"20_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":"20_CR8","first-page":"123","volume":"29","author":"H Ishii","year":"1986","unstructured":"Ishii, H., Nishida, T.: Two machine open shop scheduling problem with controllable machine speeds. J. Oper. Res. Soc. Japan 29, 123\u2013131 (1986)","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0166-218X(87)90005-9","volume":"17","author":"H Ishii","year":"1987","unstructured":"Ishii, H., Mashuda, T., Nishida, T.: Two machine mixed shop scheduling problem with controllable machine speeds. Discrete Appl. Math. 17, 29\u201338 (1987)","journal-title":"Discrete Appl. Math."},{"key":"20_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-56039-6","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B Korte","year":"2018","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 6th edn. Springer, Berlin (2018)","edition":"6"},{"issue":"4","key":"20_CR11","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_CR12","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_CR13","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."},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s10951-019-00612-y","volume":"23","author":"B Mor","year":"2020","unstructured":"Mor, B., Mosheiov, G., Shapira, D.: Flowshop scheduling with learning effect and job rejection. J. Sched. 23, 631\u2013641 (2020)","journal-title":"J. Sched."},{"key":"20_CR15","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, 553\u2013567 (2021). https:\/\/doi.org\/10.1007\/s10951-021-00697-4","journal-title":"J. Sched."},{"key":"20_CR16","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. Discrete Appl. Math. 26, 271\u2013287 (1990)","journal-title":"Discrete Appl. Math."},{"key":"20_CR17","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_CR18","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_CR19","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. Discrete Appl. Math. 155, 1643\u20131666 (2007)","journal-title":"Discrete Appl. Math."},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"2178","DOI":"10.1016\/j.dam.2005.04.014","volume":"154","author":"NV Shakhlevich","year":"2006","unstructured":"Shakhlevich, N.V., Strusevich, V.A.: Single machine scheduling with controllable release and processing times. Discrete Appl. Math. 154, 2178\u20132199 (2006)","journal-title":"Discrete Appl. Math."},{"key":"20_CR21","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":"20_CR22","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_CR23","unstructured":"Zhang Y.Z.: A survey on job scheduling with rejection (in Chinese). OR Trans. 24(2) (2020)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:04:53Z","timestamp":1680213893000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_20","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":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","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":"39","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":"12","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":"39% - 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":"5","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)"}}]}}