{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T00:17:43Z","timestamp":1774138663586,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,5,5]],"date-time":"2015-05-05T00:00:00Z","timestamp":1430784000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s12351-015-0179-8","type":"journal-article","created":{"date-parts":[[2015,5,4]],"date-time":"2015-05-04T15:59:11Z","timestamp":1430755151000},"page":"423-436","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Single-machine scheduling with preemptive jobs and workload-dependent maintenance durations"],"prefix":"10.1007","volume":"15","author":[{"given":"Zhijun","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dehua","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,5]]},"reference":[{"key":"179_CR1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1002\/nav.10045","volume":"50","author":"MS Akturk","year":"2003","unstructured":"Akturk MS, Ghosh JB, Gunes ED (2003) Scheduling with tool changes to minimize total completion time: a study of heuristics and their performance. Nav Res Logist 50:15\u201330","journal-title":"Nav Res Logist"},{"key":"179_CR2","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1016\/S0377-2217(03)00232-7","volume":"157","author":"MS Akturk","year":"2004","unstructured":"Akturk MS, Ghosh JB, Gunes ED (2004) Scheduling with tool changes to minimize total completion time: basic results and SPT performance. Eur J Oper Res 157:784\u2013790","journal-title":"Eur J Oper Res"},{"key":"179_CR3","doi-asserted-by":"crossref","first-page":"2130","DOI":"10.1016\/j.cor.2005.08.014","volume":"34","author":"MS Akturk","year":"2007","unstructured":"Akturk MS, Ghosh JB, Kayan PK (2007) Scheduling with tool changes to minimize total completion time under controllable machining conditions. Comput Oper Res 34:2130\u20132146","journal-title":"Comput Oper Res"},{"key":"179_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge"},{"key":"179_CR5","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1057\/palgrave.jors.2602043","volume":"57","author":"J-S Chen","year":"2006","unstructured":"Chen J-S (2006a) Single-machine scheduling with flexible and periodic maintenance. J Oper Res Soc 57:703\u2013710","journal-title":"J Oper Res Soc"},{"key":"179_CR6","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.ejor.2007.06.029","volume":"190","author":"J-S Chen","year":"2008","unstructured":"Chen J-S (2008a) Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan. Eur J Oper Res 190:90\u2013102","journal-title":"Eur J Oper Res"},{"key":"179_CR7","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1016\/j.omega.2006.04.006","volume":"36","author":"J-S Chen","year":"2008","unstructured":"Chen J-S (2008b) Optimization models for the tool change scheduling problem. Omega Int J Manag Sci 36:888\u2013894","journal-title":"Omega Int J Manag Sci"},{"key":"179_CR8","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1057\/palgrave.jors.2601998","volume":"57","author":"WJ Chen","year":"2006","unstructured":"Chen WJ (2006b) Minimizing total flow time in the single-machine scheduling problem with periodic maintenance. J Oper Res Soc 57:410\u2013415","journal-title":"J Oper Res Soc"},{"key":"179_CR9","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/s00170-005-0253-0","volume":"31","author":"WJ Chen","year":"2007","unstructured":"Chen WJ (2007a) Scheduling of jobs and maintenance in a textile company. Int J Adv Manuf Technol 31:737\u2013742","journal-title":"Int J Adv Manuf Technol"},{"key":"179_CR10","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1007\/s00170-006-0689-x","volume":"34","author":"WJ Chen","year":"2007","unstructured":"Chen WJ (2007b) An efficient algorithm for scheduling jobs on a machine with periodic maintenance. Int J Adv Manuf Technol 34:1173\u20131182","journal-title":"Int J Adv Manuf Technol"},{"key":"179_CR11","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1016\/j.omega.2008.01.001","volume":"37","author":"WJ Chen","year":"2009","unstructured":"Chen WJ (2009) Minimizing number of tardy jobs on a single machine subject to periodic maintenance. Omega Int J Manag Sci 37:591\u2013599","journal-title":"Omega Int J Manag Sci"},{"key":"179_CR12","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, Kan AHGR (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"key":"179_CR13","doi-asserted-by":"crossref","first-page":"1764","DOI":"10.1016\/j.cor.2005.05.034","volume":"34","author":"M Ji","year":"2007","unstructured":"Ji M, He Y, Cheng TCE (2007) Single-machine scheduling with periodic maintenance to minimize makespan. Comput Oper Res 34:1764\u20131770","journal-title":"Comput Oper Res"},{"key":"179_CR14","doi-asserted-by":"crossref","first-page":"1335","DOI":"10.1016\/S0305-0548(02)00074-6","volume":"30","author":"CJ Liao","year":"2003","unstructured":"Liao CJ, Chen WJ (2003) Single-machine scheduling with periodic maintenance and nonresumable jobs. Comput Oper Res 30:1335\u20131347","journal-title":"Comput Oper Res"},{"key":"179_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling theory: algorithms, and systems","author":"M Pinedo","year":"2012","unstructured":"Pinedo M (2012) Scheduling theory: algorithms, and systems, 4th edn. Springer, New York","edition":"4"},{"key":"179_CR16","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1057\/palgrave.jors.2600791","volume":"50","author":"X Qi","year":"1999","unstructured":"Qi X, Chen T, Tu F (1999) Scheduling the maintenance on a single machine. J Oper Res Soc 50:1071\u20131078","journal-title":"J Oper Res Soc"},{"key":"179_CR17","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1016\/j.dam.2006.06.005","volume":"155","author":"X Qi","year":"2007","unstructured":"Qi X (2007) A note on worst-case performance of heuristics for maintenance scheduling problems. Discrete Appl Math 155:416\u2013422","journal-title":"Discrete Appl Math"},{"key":"179_CR18","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1016\/j.cie.2008.03.005","volume":"55","author":"M Sbihi","year":"2008","unstructured":"Sbihi M, Varnier C (2008) Single-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness. Comput Ind Eng 55:830\u2013840","journal-title":"Comput Ind Eng"},{"key":"179_CR19","doi-asserted-by":"crossref","first-page":"2266","DOI":"10.1016\/j.cor.2005.09.002","volume":"34","author":"G-J Sheen","year":"2007","unstructured":"Sheen G-J, Liao L-W (2007) Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints. Comput Oper Res 34:2266\u20132278","journal-title":"Comput Oper Res"},{"key":"179_CR20","first-page":"1","volume":"2014","author":"X Shi","year":"2014","unstructured":"Shi X, Xu D (2014) Best possible approximation algorithms for single machine scheduling with increasing linear maintenance durations. Sci World J 2014:1\u20138","journal-title":"Sci World J"},{"key":"179_CR21","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.ijpe.2009.10.018","volume":"124","author":"K Sun","year":"2010","unstructured":"Sun K, Li H (2010) Scheduling problems with multiple maintenance activities and non-preemptive jobs on two identical parallel machines. Int J Prod Econ 124:151\u2013158","journal-title":"Int J Prod Econ"},{"key":"179_CR22","doi-asserted-by":"crossref","first-page":"1809","DOI":"10.1016\/j.cor.2008.05.001","volume":"36","author":"D Xu","year":"2009","unstructured":"Xu D, Cheng Z, Yin Y, Li H (2009) Makespan minimization for two parallel machines scheduling with a periodic availability constraint. Comput Oper Res 36:1809\u20131812","journal-title":"Comput Oper Res"},{"key":"179_CR23","doi-asserted-by":"crossref","first-page":"3715","DOI":"10.1007\/s13369-014-1003-0","volume":"39","author":"D Xu","year":"2014","unstructured":"Xu D, Liu A, Yang D-L (2014) Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities. Arab J Sci Eng 39:3715\u20133722","journal-title":"Arab J Sci Eng"},{"key":"179_CR24","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/j.omega.2012.04.003","volume":"41","author":"D Xu","year":"2013","unstructured":"Xu D, Liu M, Yin Y, Hao J (2013) Scheduling tool changes and special jobs on a single machine to minimize makespan. Omega Int J Manag Sci 41:299\u2013304","journal-title":"Omega Int J Manag Sci"},{"key":"179_CR25","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1016\/j.cor.2006.08.015","volume":"35","author":"D Xu","year":"2008","unstructured":"Xu D, Sun K, Li H (2008) Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan. Comput Oper Res 35:1344\u20131349","journal-title":"Comput Oper Res"},{"key":"179_CR26","doi-asserted-by":"crossref","first-page":"7561","DOI":"10.1016\/j.apm.2013.03.001","volume":"37","author":"D Xu","year":"2013","unstructured":"Xu D, Yang D-L (2013) Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies. Appl Math Model 37:7561\u20137567","journal-title":"Appl Math Model"},{"key":"179_CR27","doi-asserted-by":"crossref","first-page":"1139","DOI":"10.1007\/s00170-011-3249-y","volume":"56","author":"D Xu","year":"2011","unstructured":"Xu D, Yin Y (2011) On single-machine scheduling with flexible maintenance activities. Int J Adv Manuf Technol 56:1139\u20131145","journal-title":"Int J Adv Manuf Technol"},{"key":"179_CR28","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10951-010-0182-0","volume":"13","author":"D Xu","year":"2010","unstructured":"Xu D, Yin Y, Li H (2010) Scheduling jobs under increasing linear machine maintenance time. J Sched 13:443\u2013449","journal-title":"J Sched"},{"key":"179_CR29","volume-title":"Mathematical analysis: I","author":"VA Zorich","year":"2004","unstructured":"Zorich VA (2004) Mathematical analysis: I. Springer, Berlin"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-015-0179-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-015-0179-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-015-0179-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T08:04:37Z","timestamp":1559462677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-015-0179-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,5]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["179"],"URL":"https:\/\/doi.org\/10.1007\/s12351-015-0179-8","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,5]]}}}