{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T15:06:20Z","timestamp":1768403180515,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T00:00:00Z","timestamp":1630022400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T00:00:00Z","timestamp":1630022400000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10878-021-00803-4","type":"journal-article","created":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T16:03:20Z","timestamp":1630080200000},"page":"630-645","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Rescheduling problems with allowing for the unexpected new jobs arrival"],"prefix":"10.1007","volume":"43","author":[{"given":"Xingong","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Win-Chin","family":"Lin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1598-5127","authenticated-orcid":false,"given":"Chin-Chia","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,27]]},"reference":[{"key":"803_CR1","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.asoc.2016.08.037","volume":"49","author":"K Akram","year":"2016","unstructured":"Akram K, Kamal K (2016) Fast simulated annealing hybridized with quenching for solving job shop scheduling problem. Appl Soft Comput 49:510\u2013523","journal-title":"Appl Soft Comput"},{"key":"803_CR2","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ejor.2003.08.027","volume":"161","author":"H Aytug","year":"2005","unstructured":"Aytug H, Lawley MA, McKay K, Mohan S, Uzsoy R (2005) Executing production schedules in the face of uncertainties: a review and some future direction. Eur J Oper Res 161:86\u2013110","journal-title":"Eur J Oper Res"},{"key":"803_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10951-018-0570-4","volume":"22","author":"F Ballestn","year":"2019","unstructured":"Ballestn F, Prez (2019) Quintanilla S. Scheduling and rescheduling elective patients in operating rooms to minimise the percentage of tardy patients. J Schedul 22:107\u2013118","journal-title":"J Schedul"},{"key":"803_CR4","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0377-2217(95)00351-7","volume":"90","author":"F Della Croce","year":"1996","unstructured":"Della Croce F, Narayan V, Tadei R (1996) The two-machine total completion time flow shop problem. Eur J Oper Res 90:227\u2013237","journal-title":"Eur J Oper Res"},{"key":"803_CR5","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01580393","volume":"11","author":"ML Fisher","year":"1976","unstructured":"Fisher ML (1976) A dual algorithm for the one-machine scheduling problem. Math Program 11:229\u2013251","journal-title":"Math Program"},{"key":"803_CR6","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. Freeman, San Franciso"},{"key":"803_CR7","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1016\/j.cie.2019.03.011","volume":"130","author":"QZ Guo","year":"2019","unstructured":"Guo QZ, Tang LX (2019) Modelling and discrete differential evolution algorithm for order rescheduling problem in steel industry. Computers Indust Eng 130:586\u2013596","journal-title":"Computers Indust Eng"},{"key":"803_CR8","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":"803_CR9","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"},{"issue":"3","key":"803_CR10","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1007\/s10845-014-1026-0","volume":"28","author":"X Hao","year":"2017","unstructured":"Hao X, Gen M, Lin L, Suer GA (2017) Effective multiobjective EDA for bi-criteria stochastic job-shop scheduling problem. J Intell Manuf 28(3):833\u2013845","journal-title":"J Intell Manuf"},{"key":"803_CR11","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.ejor.2012.05.046","volume":"223","author":"H Hoogeveen","year":"2012","unstructured":"Hoogeveen H, Lente C, Tkindt V (2012) Rescheduling for new orders on a single machine with setup times. Eur J Oper Res 223:40\u201346","journal-title":"Eur J Oper Res"},{"issue":"4","key":"803_CR12","first-page":"511","volume":"38","author":"YH Kang","year":"2018","unstructured":"Kang YH, Zhang XG (2018) A single machine rescheduling problems with deteriorating jobs under sequence disruptions. J Syst Sci Complex 38(4):511\u2013520","journal-title":"J Syst Sci Complex"},{"key":"803_CR13","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1080\/00207543.2012.666856","volume":"51","author":"K Katragjini","year":"2013","unstructured":"Katragjini K, Vallada E, Ruiz R (2013) Flow shop rescheduling under different types of disruption. Int J Prod Res 51:780\u2013797","journal-title":"Int J Prod Res"},{"issue":"4598","key":"803_CR14","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt C, Vecchi M (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"key":"803_CR15","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","volume":"19","author":"EL Lawler","year":"1973","unstructured":"Lawler EL (1973) Optimal sequencing of a single machine subject to precedence constraints. Manag Sci 19:544\u2013546","journal-title":"Manag Sci"},{"key":"803_CR16","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"EL Lawler","year":"1977","unstructured":"Lawler EL (1977) A pseudopolynomial time algorithm for sequencing jobs to minimize total tardiness. Annal Discret Math 1:331\u2013342","journal-title":"Annal Discret Math"},{"key":"803_CR17","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.ejor.2020.03.033","volume":"90","author":"CL Li","year":"2020","unstructured":"Li CL, Li F (2020) Rescheduling production and outbound deliveries when transportation service is disrupted. Eur J Oper Res 90:138\u2013148","journal-title":"Eur J Oper Res"},{"key":"803_CR18","doi-asserted-by":"publisher","first-page":"2640","DOI":"10.1080\/00207721.2013.876519","volume":"46","author":"L Liu","year":"2015","unstructured":"Liu L, Zhou H (2015) Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption. Int J Syst Sci 46:2640\u20132658","journal-title":"Int J Syst Sci"},{"key":"803_CR19","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10951-018-0575-z","volume":"21","author":"WC Luo","year":"2018","unstructured":"Luo WC, Luo TB, Goebel R, Lin GH (2018) Rescheduling due to machine disruption to minimize the total weighted completion time. J Schedul 21:565\u2013578","journal-title":"J Schedul"},{"key":"803_CR20","doi-asserted-by":"publisher","first-page":"106574","DOI":"10.1016\/j.cie.2020.106574","volume":"146","author":"WC Luo","year":"2020","unstructured":"Luo WC, Ji M, Su B, Lin GH (2020) An approximation scheme for rejection-allowed single machine rescheduling. Computers Indust Eng 146:106574","journal-title":"Computers Indust Eng"},{"key":"803_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jss.2014.11.014","volume":"101","author":"IA Moschakis","year":"2015","unstructured":"Moschakis IA, Karatza HD (2015) Multi-criteria scheduling of Bag-of-Tasks applications on heterogeneous interlinked clouds with simulated annealing. J Syst Softw 101:1\u201314","journal-title":"J Syst Softw"},{"key":"803_CR22","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.cie.2016.03.021","volume":"96","author":"M Taghi Assadi","year":"2016","unstructured":"Taghi Assadi M, Bagheri M (2016) Differential evolution and Population-based simulated annealing for truck scheduling problem in multiple door cross-docking systems. Computers Indust Eng 96:149\u2013161","journal-title":"Computers Indust Eng"},{"key":"803_CR23","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1111\/itor.12066","volume":"21","author":"J Teghem","year":"2014","unstructured":"Teghem J, Tuyttens D (2014) A bi-objective approach to reschedule new jobs in a one machine model. Int Transactions Oper Res 21:871\u2013898","journal-title":"Int Transactions Oper Res"},{"key":"803_CR24","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.jmsy.2018.10.004","volume":"49","author":"IR Uhlmann","year":"2018","unstructured":"Uhlmann IR, Frazzon EM (2018) Production rescheduling review: opportunities for industrial integration and practical applications. J Manuf Syst 49:186\u2013193","journal-title":"J Manuf Syst"},{"issue":"19","key":"803_CR25","doi-asserted-by":"publisher","first-page":"6363","DOI":"10.1080\/00207543.2018.1468095","volume":"56","author":"P Valledora","year":"2018","unstructured":"Valledora P, Gomez A, Prioreb P, Puente J (2018) Solving multi-objective rescheduling problems in dynamic permutation flow shop environments with disruptions. Int J Prod Res 56(19):6363\u20136377","journal-title":"Int J Prod Res"},{"key":"803_CR26","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/A:1022235519958","volume":"6","author":"GE Vieira","year":"2003","unstructured":"Vieira GE, Herrmann JW, Lin E (2003) Rescheduling manufacturing systems: a framework of strategies, policies and methods. J Schedul 6:39\u201362","journal-title":"J Schedul"},{"key":"803_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 DJ, Yin YQ, Cheng TCE (2018) Parallel-machine rescheduling with job unavailability and rejection. Omega 81:246\u2013260","journal-title":"Omega"},{"issue":"9","key":"803_CR28","doi-asserted-by":"publisher","first-page":"3064","DOI":"10.1080\/00207543.2017.1401243","volume":"56","author":"CC Wu","year":"2018","unstructured":"Wu CC, Wang DJ, Cheng SR, Chung IH, Lin WC (2018) A two-stage three-machine assembly scheduling problem with a position-based learning effect. Int J Prod Res 56(9):3064\u20133079","journal-title":"Int J Prod Res"},{"key":"803_CR29","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.cor.2015.04.010","volume":"63","author":"J Xiao","year":"2015","unstructured":"Xiao J, Yang C, Zheng L, Gupta JND (2015) A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times. Computers Oper Res 63:72\u201382","journal-title":"Computers Oper Res"},{"issue":"4","key":"803_CR30","first-page":"805","volume":"17","author":"J Yang","year":"2018","unstructured":"Yang J (2018) Rescheduling a single machine with various objectives. Indust Eng Manag Syst 17(4):805\u2013818","journal-title":"Indust Eng Manag Syst"},{"key":"803_CR31","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/s00170-006-0590-7","volume":"34","author":"BB Yang","year":"2009","unstructured":"Yang BB (2009) Single machine rescheduling with new jobs arrivals and processing time compression. Int J Adv Manuf Technol 34:378\u2013384","journal-title":"Int J Adv Manuf Technol"},{"key":"803_CR32","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1016\/j.ejor.2006.07.026","volume":"182","author":"JJ Yuan","year":"2007","unstructured":"Yuan JJ, Mu YD (2007) Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption. Eur J Oper Res 182:936\u2013944","journal-title":"Eur J Oper Res"},{"issue":"3","key":"803_CR33","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10288-016-0308-0","volume":"14","author":"QL Zhao","year":"2016","unstructured":"Zhao QL, Lu LF, Yuan JJ (2016) Rescheduling with new orders and general maximum allowable time disruptions. 4OR-Q J Oper Res 14(3):261\u2013280","journal-title":"4OR-Q J Oper Res"},{"key":"803_CR34","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.apm.2009.03.037","volume":"34","author":"CL Zhao","year":"2010","unstructured":"Zhao CL, Tang HY (2010) Rescheduling problems with deteriorating jobs under disruptions. Appl Math Model 34:238\u2013243","journal-title":"Appl Math Model"},{"key":"803_CR35","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10951-013-0311-7","volume":"16","author":"QL Zhao","year":"2013","unstructured":"Zhao QL, Yuan JJ (2013) Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption. J Schedul 16:253\u2013260","journal-title":"J Schedul"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00803-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00803-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00803-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T21:05:37Z","timestamp":1648587937000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00803-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,27]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["803"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00803-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,27]]},"assertion":[{"value":"17 August 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}