{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T01:02:23Z","timestamp":1776128543156,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271491"],"award-info":[{"award-number":["12271491"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971443"],"award-info":[{"award-number":["11971443"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901168"],"award-info":[{"award-number":["11901168"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s10878-023-01074-x","type":"journal-article","created":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T11:02:40Z","timestamp":1692270160000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling problems with rejection to minimize the k-th power of the makespan plus the total rejection cost"],"prefix":"10.1007","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2561-5613","authenticated-orcid":false,"given":"Lingfa","family":"Lu","sequence":"first","affiliation":[]},{"given":"Liqi","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,17]]},"reference":[{"key":"1074_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10951-022-00745-7","volume":"26","author":"M Atsmony","year":"2023","unstructured":"Atsmony M, Mosheiov G (2023) Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection. J Sched 26:193\u2013207","journal-title":"J Sched"},{"key":"1074_CR2","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y Bartal","year":"2000","unstructured":"Bartal Y, Leonard S, Spaccamela AM, Sgall J, Stougie L (2000) Multi-processor Scheduling with Scheduling problems with rejection. SIAM J Discret Math 13:64\u201378","journal-title":"SIAM J Discret Math"},{"key":"1074_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-020-00649-2","volume":"40","author":"RX Chen","year":"2020","unstructured":"Chen RX, Li SS (2020) Minimizing maximum delivery completion time for order scheduling with rejection. J Comb Optim 40:1\u201321","journal-title":"J Comb Optim"},{"key":"1074_CR4","volume-title":"Computers and intractablity: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractablity: a guide to the theory of NP-completeness. Freeman, San Francisco, CA"},{"key":"1074_CR5","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 (2019) On the parameterized tractability of a single machine scheduling with rejection. Eur J Oper Res 273:67\u201373","journal-title":"Eur J Oper Res"},{"key":"1074_CR6","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 GJ (2003) Preemptive scheduling with rejection. Math Program 94:361\u2013374","journal-title":"Math Program"},{"key":"1074_CR7","first-page":"123","volume":"29","author":"H Ishii","year":"1986","unstructured":"Ishii H, Nishida T (1986) Two machine open shop scheduling problem with controllable machine speeds. J Oper Res Soc Jpn 29:123\u2013131","journal-title":"J Oper Res Soc Jpn"},{"key":"1074_CR8","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 (1987) Two machine mixed shop scheduling problem with controllable machine speeds. Discret Appl Math 17:29\u201338","journal-title":"Discret Appl Math"},{"key":"1074_CR9","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 (2018) Combinatorial optimization: theory and algorithms, 6th edn. Springer, Berlin","edition":"6"},{"key":"1074_CR10","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1016\/j.ejor.2022.06.025","volume":"305","author":"C Koulamas","year":"2023","unstructured":"Koulamas C, Kyparisis GJ (2023) Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection. Eur J Oper Res 305:608\u2013616","journal-title":"Eur J Oper Res"},{"key":"1074_CR11","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/s10878-020-00642-9","volume":"40","author":"PH Liu","year":"2020","unstructured":"Liu PH, Lu XW (2020) New approximation algorithms for machine scheduling with rejection on single and parallel machine. J Comb Optim 40:929\u2013952","journal-title":"J Comb Optim"},{"key":"1074_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 ZX (2020) Scheduling with partial rejection. Oper Res Lett 48:524\u2013529","journal-title":"Oper Res Lett"},{"key":"1074_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 SN (2021) Applying \u201cPeeling Onion\u2019\u2019 approach for competitive analysis in online scheduling with rejection. Eur J Oper Res 290:57\u201367","journal-title":"Eur J Oper Res"},{"key":"1074_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 (2020) Flowshop scheduling with learning effect and job rejection. J Sched 23:631\u2013641","journal-title":"J Sched"},{"key":"1074_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108168","volume":"169","author":"B Mor","year":"2022","unstructured":"Mor B, Shabtay D (2022) Single-machine scheduling with total late work and job rejection. Comput Ind Eng 169:108168","journal-title":"Comput Ind Eng"},{"key":"1074_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 (1990) A survey of results for sequencing problems with controllable processing times. Discret Appl Math 26:271\u2013287","journal-title":"Discret Appl Math"},{"key":"1074_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2020.102313","volume":"102","author":"D Oron","year":"2021","unstructured":"Oron D (2021) Two-agent scheduling problems under rejection budget constraints. Omega 102:102313","journal-title":"Omega"},{"key":"1074_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 (2013) A survey on offline scheduling with rejection. J Sched 16:3\u201328","journal-title":"J Sched"},{"key":"1074_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 (2007) A survey of scheduling with controllable processing times. Discret Appl Math 155:1643\u20131666","journal-title":"Discret Appl Math"},{"key":"1074_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 NV, Strusevich VA (2006) Single machine scheduling with controllable release and processing times. Discret Appl Math 154:2178\u20132199","journal-title":"Discret Appl Math"},{"key":"1074_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 LN, Baker KR (1982) A bicriterion approach to time\/cost trade-offs in sequencing. Eur J Oper Res 11:48\u201354","journal-title":"Eur J Oper Res"},{"key":"1074_CR22","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0166-218X(00)00176-1","volume":"103","author":"WX Xing","year":"2000","unstructured":"Xing WX, Zhang JW (2000) Parallel machine scheduling with splitting jobs. Discret Appl Math 103:259\u2013269","journal-title":"Discret Appl Math"},{"key":"1074_CR23","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1016\/j.ejor.2008.10.006","volume":"198","author":"LQ Zhang","year":"2009","unstructured":"Zhang LQ, Lu LF, Yuan JJ (2009) Single machine scheduling with release dates and rejection. Eur J Oper Res 198:975\u2013978","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1074_CR24","first-page":"111","volume":"24","author":"YZ Zhang","year":"2020","unstructured":"Zhang YZ (2020) A survey on job scheduling with rejection (in Chinese). OR Trans 24(2):111\u2013130","journal-title":"OR Trans"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01074-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01074-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01074-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T10:13:12Z","timestamp":1692785592000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01074-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1074"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01074-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8]]},"assertion":[{"value":"25 July 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors report no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"9"}}