{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:14:10Z","timestamp":1761621250791,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,2,26]],"date-time":"2016-02-26T00:00:00Z","timestamp":1456444800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11271338"],"award-info":[{"award-number":["11271338"]}],"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":["11301528"],"award-info":[{"award-number":["11301528"]}],"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":"crossref","award":["11426094"],"award-info":[{"award-number":["11426094"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Science Foundation of Henan Provinc","award":["15IRTSTHN006"],"award-info":[{"award-number":["15IRTSTHN006"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10288-016-0308-0","type":"journal-article","created":{"date-parts":[[2016,2,26]],"date-time":"2016-02-26T03:03:35Z","timestamp":1456455815000},"page":"261-280","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Rescheduling with new orders and general maximum allowable time disruptions"],"prefix":"10.1007","volume":"14","author":[{"given":"Qiulan","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Lingfa","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Jinjiang","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,26]]},"reference":[{"key":"308_CR1","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.cor.2015.05.015","volume":"64","author":"C Akkan","year":"2015","unstructured":"Akkan C (2015) Improving schedule stability in single-machine rescheduling for new operation insertion. Comput Oper Res 64:198\u2013209","journal-title":"Comput Oper Res"},{"key":"308_CR2","doi-asserted-by":"crossref","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":"308_CR3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1080\/09511929208944524","volume":"5","author":"LK Church","year":"1992","unstructured":"Church LK, Uzsoy R (1992) Analysis of periodic and event-driven rescheduling policies in dynamic shops. Int J Comput Integr Manuf 5:153\u2013163","journal-title":"Int J Comput Integr Manuf"},{"key":"308_CR4","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s40305-015-0083-1","volume":"3","author":"Y Gao","year":"2015","unstructured":"Gao Y, Yuan JJ (2015) Pareto minimizing total completion time and maximum cost with positional due indices. J Oper Res Soc China 3:381\u2013387","journal-title":"J Oper Res Soc China"},{"key":"308_CR5","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 Francisco"},{"key":"308_CR6","doi-asserted-by":"crossref","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 AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"key":"308_CR7","doi-asserted-by":"crossref","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":"308_CR8","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1287\/ijoc.1060.0209","volume":"19","author":"NG Hall","year":"2007","unstructured":"Hall NG, Liu ZX, Potts CN (2007) Rescheduling for multiple new orders. INFORMS J Comput 19:633\u2013645","journal-title":"INFORMS J Comput"},{"key":"308_CR9","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.ejor.2012.05.046","volume":"223","author":"H Hoogeveen","year":"2012","unstructured":"Hoogeveen H, Lent\u00e9 C, T\u2019kindt 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"},{"unstructured":"Jackson JR (1955) Scheduling a production line to minimize maximum tardiness. Research report 43, Management Science Research Project, University of California, Los Angeles, CA","key":"308_CR10"},{"key":"308_CR11","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1080\/002075497196082","volume":"35","author":"AK Jain","year":"1997","unstructured":"Jain AK, Elmaraghy HA (1997) Production scheduling\/rescheduling in flexible manufacturing. Int J Prod Res 35:281\u2013309","journal-title":"Int J Prod Res"},{"key":"308_CR12","doi-asserted-by":"crossref","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"},{"key":"308_CR13","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0377-2217(00)00207-1","volume":"133","author":"C Koulamas","year":"2001","unstructured":"Koulamas C, Kyparisis GJ (2001) Single machine scheduling with release times, deadlines and tardiness objectives. Eur J Oper Res 133:447\u2013453","journal-title":"Eur J Oper Res"},{"key":"308_CR14","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.orl.2004.04.008","volume":"33","author":"R Leus","year":"2005","unstructured":"Leus R, Herroelen W (2005) The complexity of machine scheduling for stability with a single disrupted job. Oper Res Lett 33:151\u2013156","journal-title":"Oper Res Lett"},{"key":"308_CR15","doi-asserted-by":"crossref","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":"308_CR16","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1080\/00207543.2011.571458","volume":"50","author":"P Moratori","year":"2012","unstructured":"Moratori P, Petrovic S, V\u00e1zquez-Rodr\u00edguez JA (2012) Match-up approaches to a dynamic rescheduling problem. Int J Prod Res 50:261\u2013276","journal-title":"Int J Prod Res"},{"doi-asserted-by":"publisher","unstructured":"Mu YD, Guo X (2009) On-line rescheduling to minimize makespan under a limit on the maximum sequence disruption. In: Proceeding of the 2009 international conference on services science, management and engineering, IEEE Computer Society, pp 479\u2013482. doi: 10.1109\/SSME.2009.44","key":"308_CR17","DOI":"10.1109\/SSME.2009.44"},{"doi-asserted-by":"publisher","unstructured":"Mu YD, Guo X (2009) On-line rescheduling to minimize makespan under a limit on the maximum disruptions. In: Proceeding of the 2009 international conference on management of e-commerce and e-government. IEEE Computer Society, pp 141\u2013144. doi: 10.1109\/ICMeCG.2009.26","key":"308_CR18","DOI":"10.1109\/ICMeCG.2009.26"},{"key":"308_CR19","first-page":"441","volume":"40","author":"YD Mu","year":"2010","unstructured":"Mu YD, Tian XZ (2010) Pareto optimizations of objective and disruptions for rescheduling problems. J Henan Univ (Nat Sci) 40:441\u2013444","journal-title":"J Henan Univ (Nat Sci)"},{"key":"308_CR20","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0272-6963(89)90015-6","volume":"8","author":"N Raman","year":"1989","unstructured":"Raman N, Talbot FB, Rachamadugu RV (1989) Due date based scheduling in a general flexible manufacturing system. J Oper Manag 8:115\u2013132","journal-title":"J Oper Manag"},{"key":"308_CR21","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith WE (1956) Various optimizers for single-stage production. Naval Res Logist Q 3:59\u201366","journal-title":"Naval Res Logist Q"},{"key":"308_CR22","doi-asserted-by":"crossref","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 Trans Oper Res 21:871\u2013898","journal-title":"Int Trans Oper Res"},{"key":"308_CR23","doi-asserted-by":"crossref","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":"308_CR24","doi-asserted-by":"crossref","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 Sched 6:39\u201362","journal-title":"J Sched"},{"key":"308_CR25","first-page":"292","volume-title":"New directions for operations research in manufacturing","author":"SD Wu","year":"1992","unstructured":"Wu SD, Storer RH, Chang P-C (1992) A rescheduling procedure for manufacturing systems under random disruptions. In: Fandel G, Gulledge T, Jone A (eds) New directions for operations research in manufacturing. Springer, Berlin, pp 292\u2013308"},{"key":"308_CR26","doi-asserted-by":"crossref","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"},{"key":"308_CR27","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1142\/S021759590700153X","volume":"24","author":"JJ Yuan","year":"2007","unstructured":"Yuan JJ, Mu YD, Lu LF, Li WH (2007) Rescheduling with release dates to minimize total sequence disruption under a limit on the makespan. Asia-Pacific J Oper Res 24:789\u2013796","journal-title":"Asia-Pacific J Oper Res"},{"unstructured":"Zhao QL (2012) Rescheduling research under pareto optimization, job-disruptions and weighted disruptions. Master Degree Thesis, Zhengzhou University","key":"308_CR28"},{"key":"308_CR29","doi-asserted-by":"crossref","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":"308_CR30","doi-asserted-by":"crossref","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 Sched 16:253\u2013260","journal-title":"J Sched"},{"unstructured":"Zhao QL, Yuan JJ (2007) Rescheduling to minimize the maximum lateness under the sequence disruption of original jobs. Asia-Pac J Oper Res (accepted)","key":"308_CR31"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-016-0308-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-016-0308-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-016-0308-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T08:13:00Z","timestamp":1559117580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-016-0308-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,26]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["308"],"URL":"https:\/\/doi.org\/10.1007\/s10288-016-0308-0","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2016,2,26]]}}}