{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T05:46:25Z","timestamp":1761975985722,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T00:00:00Z","timestamp":1649376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T00:00:00Z","timestamp":1649376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971252","11771114"],"award-info":[{"award-number":["11971252","11771114"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007834","name":"Natural Science Foundation of Ningbo","doi-asserted-by":"publisher","award":["2018A610198"],"award-info":[{"award-number":["2018A610198"]}],"id":[{"id":"10.13039\/100007834","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LY19A010005"],"award-info":[{"award-number":["LY19A010005"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","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":[[2022,8]]},"DOI":"10.1007\/s10878-022-00857-y","type":"journal-article","created":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T08:04:32Z","timestamp":1649405072000},"page":"690-722","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling"],"prefix":"10.1007","volume":"44","author":[{"given":"Wenchang","family":"Luo","sequence":"first","affiliation":[]},{"given":"Rylan","family":"Chin","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Cai","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4283-3396","authenticated-orcid":false,"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Bing","family":"Su","sequence":"additional","affiliation":[]},{"given":"An","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,8]]},"reference":[{"key":"857_CR1","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/s10696-015-9213-7","volume":"28","author":"B Addis","year":"2016","unstructured":"Addis B, Carello G, Grosso A, T\u00e0nfani E (2016) Operating room scheduling and rescheduling: a rolling horizon approach. Flex Serv Manuf J 28:206\u2013232","journal-title":"Flex Serv Manuf J"},{"key":"857_CR2","doi-asserted-by":"crossref","unstructured":"Bartal Y, Leonardi S, Marchetti-Spaccamela A, Sgall J, Stougie L (2000) Multiprocessor scheduling with rejection. In: Proceedings of ACM-IEEE SODA 2000, pp 95\u2013103","DOI":"10.1137\/S0895480196300522"},{"key":"857_CR3","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1287\/opre.39.3.470","volume":"39","author":"JC Bean","year":"1991","unstructured":"Bean JC, Birge JR, Mittenthal J, Noon CE (1991) Matchup scheduling with multiple resources, release dates and disruptions. Oper Res 39:470\u2013483","journal-title":"Oper Res"},{"key":"857_CR4","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ejor.2007.11.047","volume":"194","author":"Y Cheng","year":"2007","unstructured":"Cheng Y, Sun S (2007) Scheduling linear deteriorating jobs with rejection on a single machine. Eur J Oper Res 194:18\u201327","journal-title":"Eur J Oper Res"},{"key":"857_CR5","first-page":"40","volume":"28","author":"J Clausen","year":"2001","unstructured":"Clausen J, Larsen J, Larsen A, Hansen J (2001) Disruption management\u2014operations research between planning and execution. OR\/MS Today 28:40\u201343","journal-title":"OR\/MS Today"},{"key":"857_CR6","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/j.ejor.2014.07.008","volume":"240","author":"K Dahal","year":"2015","unstructured":"Dahal K, Al-Arfaj K, Paudyal K (2015) Modelling generator maintenance scheduling costs in deregulated power markets. Eur J Oper Res 240:551\u2013561","journal-title":"Eur J Oper Res"},{"key":"857_CR7","volume-title":"Computers and intractability: a guide to the theory of np-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of np-completeness. W. H. Freeman and Company, San Francisco"},{"key":"857_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan A, Rinnooy Kan A H G (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Disc Math 5:287\u2013326","journal-title":"Ann Disc Math"},{"key":"857_CR9","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1057\/palgrave.jors.2601638","volume":"54","author":"JND Gupta","year":"2003","unstructured":"Gupta JND, Ruiz-Torres AJ, Webster S (2003) Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time. J Oper Res Soc 54:1263\u20131274","journal-title":"J Oper Res Soc"},{"key":"857_CR10","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1287\/ijoc.1060.0209","volume":"19","author":"NG Hall","year":"2007","unstructured":"Hall NG, Liu Z, Potts CN (2007) Rescheduling for multiple new orders. INFORMS J Comput 19:633\u2013645","journal-title":"INFORMS J Comput"},{"key":"857_CR11","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1287\/opre.1030.0101","volume":"52","author":"NG Hall","year":"2004","unstructured":"Hall NG, Potts CN (2004) Rescheduling for new orders. Oper Res 52:440\u2013453","journal-title":"Oper Res"},{"key":"857_CR12","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1287\/opre.1090.0751","volume":"58","author":"NG Hall","year":"2010","unstructured":"Hall NG, Potts CN (2010) Rescheduling for job unavailability. Oper Res 58:746\u2013755","journal-title":"Oper Res"},{"key":"857_CR13","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.tcs.2017.09.004","volume":"703","author":"D Li","year":"2017","unstructured":"Li D, Lu X (2017) Two-agent parallel-machine scheduling with rejection. Theoret Comput Sci 703:66\u201375","journal-title":"Theoret Comput Sci"},{"key":"857_CR14","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.ejor.2017.09.015","volume":"266","author":"Z Liu","year":"2018","unstructured":"Liu Z, Lu L, Qi X (2018) Cost allocation in rescheduling with machine unavailable period. Eur J Oper Res 266:16\u201328","journal-title":"Eur J Oper Res"},{"key":"857_CR15","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10951-014-0372-2","volume":"17","author":"Z Liu","year":"2014","unstructured":"Liu Z, Ro YK (2014) Rescheduling for machine disruption to minimize makespan and maximum lateness. J Sched 17:339\u2013352","journal-title":"J Sched"},{"key":"857_CR16","doi-asserted-by":"crossref","unstructured":"Luo W, Jin M, Su B, Lin G (2020) An approximation scheme for rejection-allowed single-machine rescheduling. Comput Indus Eng 146 (Article 106574)","DOI":"10.1016\/j.cie.2020.106574"},{"key":"857_CR17","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10951-018-0575-z","volume":"21","author":"W Luo","year":"2018","unstructured":"Luo W, Luo T, Goebel R, Lin G (2018) Rescheduling due to machine disruption to minimize the total weighted completion time. J Sched 21:565\u2013578","journal-title":"J Sched"},{"key":"857_CR18","doi-asserted-by":"publisher","first-page":"2531","DOI":"10.1016\/j.apm.2012.06.012","volume":"37","author":"N Manavizadeh","year":"2013","unstructured":"Manavizadeh N, Goodarzi AH, Rabbani M, Jolai F (2013) Order acceptance\/rejection policies in determining the sequence in mixed model assembly lines. Appl Math Model 37:2531\u20132351","journal-title":"Appl Math Model"},{"key":"857_CR19","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1016\/j.ejor.2017.04.036","volume":"262","author":"J Ou","year":"2017","unstructured":"Ou J, Zhong X (2017) Bicriteria order acceptance and scheduling with consideration of fill rate. Eur J Oper Res 262:904\u2013907","journal-title":"Eur J Oper Res"},{"key":"857_CR20","unstructured":"Rinnooy Kan AHG (1976) Machine scheduling problems: classification, complexity, and computations. Springer"},{"key":"857_CR21","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.ejor.2013.08.013","volume":"233","author":"D Shabtay","year":"2014","unstructured":"Shabtay D (2014) The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost. Eur J Oper Res 233:64\u201374","journal-title":"Eur J Oper Res"},{"key":"857_CR22","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1023\/A:1018955111939","volume":"70","author":"AT Unal","year":"1997","unstructured":"Unal AT, Uzsoy R, Kiran AS (1997) Rescheduling on a single machine with part-type dependent setup times and deadlines. Ann Oper Res 70:93\u2013113","journal-title":"Ann Oper Res"},{"key":"857_CR23","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.omega.2018.04.008","volume":"81","author":"D Wang","year":"2018","unstructured":"Wang D, Yin Y, Cheng TCE (2018) Parallel-machine rescheduling with job unavailability and rejection. Omega 81:246\u2013260","journal-title":"Omega"},{"key":"857_CR24","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.cor.2016.04.024","volume":"79","author":"D-J Wang","year":"2017","unstructured":"Wang D-J, Liu F, Jin Y (2017) A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling. Comput Oper Res 79:279\u2013290","journal-title":"Comput Oper Res"},{"key":"857_CR25","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-77537-6_18","volume-title":"New directions for operations research in manufacturing","author":"SD Wu","year":"1992","unstructured":"Wu SD, Storer RH, Chang PC (1992) A rescheduling procedure for manufacturing systems under random disruptions. In: Fandel G, Gulledge T, Jones A (eds) New directions for operations research in manufacturing. Springer, Berlin, Heidelberg, pp 292\u2013306"},{"key":"857_CR26","doi-asserted-by":"publisher","first-page":"1578","DOI":"10.1109\/TSMC.2015.2505644","volume":"46","author":"Y Yin","year":"2016","unstructured":"Yin Y, Cheng TCE, Wang D, Wu CC (2016) Improved algorithms for single-machine serial-batch scheduling with rejection to minimize total completion time and total rejection cost. IEEE Trans Syst Man Cybern Syst 46:1578\u20131588","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"857_CR27","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1016\/j.ejor.2016.01.045","volume":"252","author":"Y Yin","year":"2016","unstructured":"Yin Y, Cheng TCE, Wang D-J (2016) Rescheduling on identical parallel machines with machine disruptions to minimize total completion time. Eur J Oper Res 252:737\u2013749","journal-title":"Eur J Oper Res"},{"key":"857_CR28","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1287\/inte.33.1.5.12720","volume":"33","author":"G Yu","year":"2003","unstructured":"Yu G, Arg\u00fcello M, Song G, McCowan SM, White A (2003) A new era for crew recovery at continental airlines. INFORMS J Appl Anal 33:5\u201322","journal-title":"INFORMS J Appl Anal"},{"key":"857_CR29","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/j.tcs.2010.02.006","volume":"411","author":"L Zhang","year":"2010","unstructured":"Zhang L, Lu L, Yuan J (2010) Single-machine scheduling under the job rejection constraint. Theor Comput Sci 411:1877\u20131882","journal-title":"Theor Comput Sci"},{"key":"857_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-021-00803-4","author":"X Zhang","year":"2021","unstructured":"Zhang X, Lin W-C, Wu C-C (2021) Rescheduling problems with allowing for the unexpected new jobs arrival. J Comb Optim. https:\/\/doi.org\/10.1007\/s10878-021-00803-4","journal-title":"J Comb Optim"},{"key":"857_CR31","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10288-016-0308-0","volume":"14","author":"Q Zhao","year":"2016","unstructured":"Zhao Q, Lu L, Yuan J (2016) Rescheduling with new orders and general maximum allowable time disruptions. 4OR 14:261\u2013280","journal-title":"4OR"},{"key":"857_CR32","doi-asserted-by":"publisher","first-page":"1588","DOI":"10.1109\/21.257756","volume":"23","author":"M Zweben","year":"1993","unstructured":"Zweben M, Davis E, Daun B, Deale MJ (1993) Scheduling and rescheduling with iterative repair. IEEE Trans Syst Man Cybern 23:1588\u20131596","journal-title":"IEEE Trans Syst Man Cybern"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00857-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00857-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00857-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:33:23Z","timestamp":1659080003000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00857-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,8]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["857"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00857-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,4,8]]},"assertion":[{"value":"21 March 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2022","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 declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Interests"}}]}}