{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T09:01:58Z","timestamp":1775034118157,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,10,5]],"date-time":"2017-10-05T00:00:00Z","timestamp":1507161600000},"content-version":"unspecified","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":["71201022"],"award-info":[{"award-number":["71201022"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10951-017-0543-z","type":"journal-article","created":{"date-parts":[[2017,10,4]],"date-time":"2017-10-04T22:10:29Z","timestamp":1507155029000},"page":"461-482","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7077-8622","authenticated-orcid":false,"given":"Zhijun","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9704-9868","authenticated-orcid":false,"given":"Dehua","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,5]]},"reference":[{"issue":"1","key":"543_CR1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1002\/nav.10045","volume":"50","author":"MS Akturk","year":"2003","unstructured":"Akturk, M. S., Ghosh, J. B., & Gunes, E. D. (2003). Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance. Naval Research Logistics, 50(1), 15\u201330.","journal-title":"Naval Research Logistics"},{"issue":"3","key":"543_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, M. S., Ghosh, J. B., & Gunes, E. D. (2004). Scheduling with tool changes to minimize total completion time: Basic results and SPT performance. European Journal of Operational Research, 157(3), 784\u2013790.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"543_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, M. S., Ghosh, J. B., & Kayan, R. K. (2007). Scheduling with tool changes to minimize total completion time under controllable machining conditions. Computers & Operations Research, 34(7), 2130\u20132146.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"543_CR4","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1023\/A:1024012811536","volume":"6","author":"P Baptiste","year":"2003","unstructured":"Baptiste, P., & Schieber, B. (2003). A note on scheduling tall\/small multiprocessor tasks with unit processing time to minimize maximum tardiness. Journal of Scheduling, 6(4), 395\u2013404.","journal-title":"Journal of Scheduling"},{"issue":"5","key":"543_CR5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0167-6377(01)00068-2","volume":"28","author":"P Baptiste","year":"2001","unstructured":"Baptiste, P., & Timkovsky, V. G. (2001). On preemption redundancy in scheduling unit processing time jobs on two parallel machines. Operations Research Letters, 28(5), 205\u2013212.","journal-title":"Operations Research Letters"},{"key":"543_CR6","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.tcs.2012.02.003","volume":"508","author":"M Birks","year":"2013","unstructured":"Birks, M., & Fung, S. P. Y. (2013). Temperature aware online algorithms for scheduling equal length jobs. Theoretical Computer Science, 508, 54\u201365.","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"543_CR7","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s10951-010-0167-z","volume":"13","author":"J Blazewicz","year":"2010","unstructured":"Blazewicz, J., Ecker, K., Kis, T., Potts, C. N., Tanas, M., & Whitehead, J. (2010). Scheduling of coupled tasks with unit processing times. Journal of Scheduling, 13(5), 453\u2013461.","journal-title":"Journal of Scheduling"},{"key":"543_CR8","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1007\/s10951-016-0471-3","volume":"19","author":"P Brucker","year":"2016","unstructured":"Brucker, P., & Shakhlevich, N. V. (2016). Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines. Journal of Scheduling, 19, 659\u2013685.","journal-title":"Journal of Scheduling"},{"issue":"5","key":"543_CR9","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1016\/j.omega.2006.04.006","volume":"36","author":"JS Chen","year":"2008","unstructured":"Chen, J. S. (2008). Optimization models for the tool change scheduling problem. Omega, 36(5), 888\u2013894.","journal-title":"Omega"},{"key":"543_CR10","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/j.amc.2013.05.045","volume":"220","author":"E Gerstl","year":"2013","unstructured":"Gerstl, E., & Mosheiov, G. (2013a). Due-window assignment problems with unit-time jobs. Applied Mathematics and Computation, 220, 487\u2013495.","journal-title":"Applied Mathematics and Computation"},{"issue":"1","key":"543_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.ejor.2012.12.034","volume":"229","author":"E Gerstl","year":"2013","unstructured":"Gerstl, E., & Mosheiov, G. (2013b). Due-window assignment with identical jobs on parallel uniform machines. European Journal of Operational Research, 229(1), 41\u201347.","journal-title":"European Journal of Operational Research"},{"issue":"19","key":"543_CR12","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1016\/j.ipl.2013.06.013","volume":"113","author":"E Gerstl","year":"2013","unstructured":"Gerstl, E., & Mosheiov, G. (2013c). An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs. Information Processing Letters, 113(19), 754\u2013759.","journal-title":"Information Processing Letters"},{"key":"543_CR13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"4","key":"543_CR14","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1016\/j.jco.2005.04.004","volume":"21","author":"S Heinz","year":"2005","unstructured":"Heinz, S. (2005). Complexity of integer quasiconvex polynomial optimization. Journal of Complexity, 21(4), 543\u2013556.","journal-title":"Journal of Complexity"},{"key":"543_CR15","unstructured":"Hemmecke, R., K\u00f6ppe, M., Lee, J., & Weismantel, R. (2010). Nonlinear integer programming. In 50 years of integer programming 1958\u20132008 (pp. 561\u2013618). New York, NY: Springer."},{"issue":"3","key":"543_CR16","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/nav.3800030307","volume":"3","author":"JR Jackson","year":"1956","unstructured":"Jackson, J. R. (1956). An extension of Johnson\u2019s results on job IDT scheduling. Naval Research Logistics Quarterly, 3(3), 201\u2013203.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"4","key":"543_CR17","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10288-012-0201-4","volume":"10","author":"A Janiak","year":"2012","unstructured":"Janiak, A., Janiak, W., Kovalyov, M. Y., & Werner, F. (2012). Soft due window assignment and scheduling of unit-time jobs on parallel machines. 4OR, 10(4), 347\u2013360.","journal-title":"4OR"},{"issue":"1","key":"543_CR18","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S. M. (1954). Optimal two-and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1(1), 61\u201368.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"4","key":"543_CR19","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra, H. W, Jr. (1983). Integer programming with a fixed number of variables. Mathematics of Operations Research, 8(4), 538\u2013548.","journal-title":"Mathematics of Operations Research"},{"issue":"11","key":"543_CR20","doi-asserted-by":"crossref","first-page":"3612","DOI":"10.1016\/j.cor.2007.03.006","volume":"35","author":"CL Li","year":"2008","unstructured":"Li, C. L., Mosheiov, G., & Yovel, U. (2008). An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs. Computers & Operations Research, 35(11), 3612\u20133619.","journal-title":"Computers & Operations Research"},{"key":"543_CR21","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.tcs.2014.05.024","volume":"543","author":"W Li","year":"2014","unstructured":"Li, W., Yuan, J., & Yang, S. (2014). Online scheduling of incompatible unit-length job families with lookahead. Theoretical Computer Science, 543, 120\u2013125.","journal-title":"Theoretical Computer Science"},{"key":"543_CR22","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.tcs.2013.11.026","volume":"521","author":"T Luo","year":"2014","unstructured":"Luo, T., Xu, Y., Luo, L., & He, C. (2014). Semi-online scheduling with two gos levels and unit processing time. Theoretical Computer Science, 521, 62\u201372.","journal-title":"Theoretical Computer Science"},{"key":"543_CR23","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.cie.2014.11.002","volume":"79","author":"W Luo","year":"2015","unstructured":"Luo, W., Cheng, T. E., & Ji, M. (2015). Single-machine scheduling with a variable maintenance activity. Computers & Industrial Engineering, 79, 168\u2013174.","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"543_CR24","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.ipl.2014.08.011","volume":"115","author":"W Luo","year":"2015","unstructured":"Luo, W., & Ji, M. (2015). Scheduling a variable maintenance and linear deteriorating jobs on a single machine. Information Processing Letters, 115(1), 33\u201339.","journal-title":"Information Processing Letters"},{"issue":"3","key":"543_CR25","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1016\/S0377-2217(99)00432-4","volume":"130","author":"G Mosheiov","year":"2001","unstructured":"Mosheiov, G., & Shadmon, M. (2001). Minmax earliness-tardiness costs with unit processing time jobs. European Journal of Operational Research, 130(3), 638\u2013652.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"543_CR26","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/j.ejor.2004.10.021","volume":"172","author":"G Mosheiov","year":"2006","unstructured":"Mosheiov, G., & Yovel, U. (2006). Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs. European Journal of Operational Research, 172(2), 528\u2013544.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"543_CR27","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.ejor.2015.01.003","volume":"244","author":"D Oron","year":"2015","unstructured":"Oron, D., Shabtay, D., & Steiner, G. (2015). Single machine scheduling with two competing agents and equal job processing times. European Journal of Operational Research, 244(1), 86\u201399.","journal-title":"European Journal of Operational Research"},{"key":"543_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling: Theory, algorithms, and systems","author":"ML Pinedo","year":"2012","unstructured":"Pinedo, M. L. (2012). Scheduling: Theory, algorithms, and systems (4th ed.). New York, NY: Springer.","edition":"4"},{"issue":"3","key":"543_CR29","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 Applied Mathematics, 155(3), 416\u2013422.","journal-title":"Discrete Applied Mathematics"},{"key":"543_CR30","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, T. (1999). Scheduling the maintenance on a single machine. Journal of the Operational Research Society, 50, 1071\u20131078.","journal-title":"Journal of the Operational Research Society"},{"issue":"10","key":"543_CR31","doi-asserted-by":"crossref","first-page":"1586","DOI":"10.1016\/j.dam.2013.01.019","volume":"161","author":"A Quilliot","year":"2013","unstructured":"Quilliot, A., & Chr\u00e9tienne, P. (2013). Homogeneously non-idling schedules of unit-time jobs on identical parallel machines. Discrete Applied Mathematics, 161(10), 1586\u20131597.","journal-title":"Discrete Applied Mathematics"},{"issue":"8","key":"543_CR32","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1016\/j.ress.2010.03.005","volume":"95","author":"CEP Rodriguez","year":"2010","unstructured":"Rodriguez, C. E. P., & de Souza, G. F. M. (2010). Reliability concepts applied to cutting tool change time. Reliability Engineering & System Safety, 95(8), 866\u2013873.","journal-title":"Reliability Engineering & System Safety"},{"issue":"3","key":"543_CR33","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/B:JOCO.0000038909.06086.ed","volume":"8","author":"SC Sarin","year":"2004","unstructured":"Sarin, S. C., & Prakash, D. (2004). Equal processing time bicriteria scheduling on parallel machines. Journal of Combinatorial Optimization, 8(3), 227\u2013240.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"4","key":"543_CR34","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.disopt.2012.07.005","volume":"9","author":"D Shabtay","year":"2012","unstructured":"Shabtay, D., & Karhi, S. (2012a). An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times. Discrete Optimization, 9(4), 241\u2013248.","journal-title":"Discrete Optimization"},{"issue":"2","key":"543_CR35","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.cor.2011.05.002","volume":"39","author":"D Shabtay","year":"2012","unstructured":"Shabtay, D., & Karhi, S. (2012b). Online scheduling of two job types on a set of multipurpose machines with unit processing times. Computers & Operations Research, 39(2), 405\u2013412.","journal-title":"Computers & Operations Research"},{"issue":"1\u20132","key":"543_CR36","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3(1\u20132), 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"2","key":"543_CR37","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/j.ejor.2010.01.016","volume":"205","author":"NH Tuong","year":"2010","unstructured":"Tuong, N. H., & Soukhal, A. (2010). Due dates assignment and JIT scheduling with equal-size jobs. European Journal of Operational Research, 205(2), 280\u2013289.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"543_CR38","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-International Journal of Management Science, 41(2), 299\u2013304.","journal-title":"Omega-International Journal of Management Science"},{"key":"543_CR39","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.omega.2014.11.002","volume":"52","author":"D Xu","year":"2015","unstructured":"Xu, D., Wan, L., Liu, A., & Yang, D. L. (2015). Single machine total completion time scheduling problem with workload-dependent maintenance duration. Omega-International Journal of Management Science, 52, 101\u2013106.","journal-title":"Omega-International Journal of Management Science"},{"issue":"4","key":"543_CR40","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. Journal of Scheduling, 13(4), 443\u2013449.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"543_CR41","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s12351-015-0179-8","volume":"15","author":"Z Xu","year":"2015","unstructured":"Xu, Z., & Xu, D. (2015). Single-machine scheduling with preemptive jobs and workload-dependent maintenance durations. Operational Research, 15(3), 423\u2013436.","journal-title":"Operational Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-017-0543-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0543-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0543-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T08:01:29Z","timestamp":1531296089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-017-0543-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,5]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["543"],"URL":"https:\/\/doi.org\/10.1007\/s10951-017-0543-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,5]]}}}