{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,14]],"date-time":"2026-08-14T09:40:26Z","timestamp":1786700426799,"version":"build-2736575974"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,8,4]],"date-time":"2012-08-04T00:00:00Z","timestamp":1344038400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s10951-012-0280-2","type":"journal-article","created":{"date-parts":[[2012,8,3]],"date-time":"2012-08-03T17:28:40Z","timestamp":1344014920000},"page":"661-673","source":"Crossref","is-referenced-by-count":29,"title":["A multi-start tabu search method for a single-machine scheduling problem with periodic maintenance and sequence-dependent set-up times"],"prefix":"10.1007","volume":"16","author":[{"given":"Joaqu\u00edn","family":"Pacheco","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francisco","family":"\u00c1ngel-Bello","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ada","family":"\u00c1lvarez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,8,4]]},"reference":[{"issue":"3","key":"280_CR1","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A. Allahverdi","year":"2008","unstructured":"Allahverdi, A., Ng, C. T., Cheng, T. C. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985\u20131032.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"280_CR2","doi-asserted-by":"crossref","first-page":"2041","DOI":"10.1016\/j.apm.2010.11.017","volume":"35","author":"F. \u00c1ngel-Bello","year":"2011","unstructured":"\u00c1ngel-Bello, F., \u00c1lvarez, A., Pacheco, J., & Mart\u00ednez, I. (2011a). A single machine scheduling problem with availability constraints and sequence-dependent setup costs. Applied Mathematical Modelling, 35(4), 2041\u20132050.","journal-title":"Applied Mathematical Modelling"},{"issue":"4","key":"280_CR3","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1016\/j.camwa.2010.12.028","volume":"61","author":"F. \u00c1ngel-Bello","year":"2011","unstructured":"\u00c1ngel-Bello, F., \u00c1lvarez, A., Pacheco, J., & Mart\u00ednez, I. (2011b). A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times. Computers & Mathematics with Applications, 61(4), 797\u2013808.","journal-title":"Computers & Mathematics with Applications"},{"issue":"7","key":"280_CR4","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1080\/095372800432188","volume":"11","author":"V. A. Armentano","year":"2000","unstructured":"Armentano, V. A., & Mazzini, R. (2000). A genetic algorithm for scheduling on a single machine with set-up times and due dates. Production Planning & Control, 11(7), 713\u2013720.","journal-title":"Production Planning & Control"},{"key":"280_CR5","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.ejor.2007.06.029","volume":"190(1)","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. European Journal of Operational Research, 190(1), 90\u2013102.","journal-title":"European Journal of Operational Research"},{"issue":"1\u20132","key":"280_CR6","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/s00170-007-1070-4","volume":"38","author":"W. Chen","year":"2008","unstructured":"Chen, W. (2008b). Sequencing heuristic for scheduling jobs with dependent setups in a manufacturing system. The International Journal of Advanced Manufacturing Technology, 38(1\u20132), 176\u2013184.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"3","key":"280_CR7","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1016\/j.cie.2009.03.001","volume":"57","author":"W. Chen","year":"2009","unstructured":"Chen, W. (2009). Scheduling with dependent setups and maintenance in a textile company. Computers & Industrial Engineering, 57(3), 867\u2013873.","journal-title":"Computers & Industrial Engineering"},{"issue":"11","key":"280_CR8","first-page":"365","volume":"46","author":"S. R. Das","year":"1995","unstructured":"Das, S. R., Gupta, J. N. D., & Khumawala, B. M. (1995). A saving index heuristic algorithm for flowshop scheduling with sequence dependent set-up times. Journal of the Operational Research Society, 46(11), 365\u2013373.","journal-title":"Journal of the Operational Research Society"},{"key":"280_CR9","series-title":"Modeling and analysis","volume-title":"Planning and control of maintenance systems","author":"A. Duffua","year":"1999","unstructured":"Duffua, A., Salih, O., Raouf, A., & Campbell, J. (1999). Planning and control of maintenance systems. Modeling and analysis. New York: Wiley."},{"issue":"1","key":"280_CR10","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0377-2217(00)00140-5","volume":"132","author":"P. M. Fran\u00e7a","year":"2001","unstructured":"Fran\u00e7a, P. M., Mendes, A., & Moscato, P. (2001). A memetic algorithm for the total tardiness single machine scheduling problem. European Journal of Operational Research, 132(1), 224\u2013242.","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"280_CR11","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1057\/palgrave.jors.2601390","volume":"53","author":"C. Gagne","year":"2002","unstructured":"Gagne, C., Price, W. L., & Gravel, M. (2002). Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times. Journal of the Operational Research Society, 53(8), 895\u2013906.","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"280_CR12","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1108\/13552510610685075","volume":"12","author":"A. Garg","year":"2006","unstructured":"Garg, A., & Deshmukh, S. G. (2006). Maintenance management: literature review and directions. Journal of Quality in Maintenance Engineering, 12(3), 205\u2013238.","journal-title":"Journal of Quality in Maintenance Engineering"},{"issue":"1","key":"280_CR13","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F. Glover","year":"1977","unstructured":"Glover, F. (1977). Heuristics for integer programming using surrogate constraints. Decision Sciences, 8(1), 156\u2013166.","journal-title":"Decision Sciences"},{"key":"280_CR14","first-page":"1","volume-title":"Interfaces in computer science and operations research","author":"F. Glover","year":"1996","unstructured":"Glover, F. (1996). Tabu search and adaptive memory programming. Advances, applications and challenges. In R. Barr, R. Helgason, & J. Kennington (Eds.), Interfaces in computer science and operations research (pp. 1\u201375). Dordrecht: Kluwer Academic Publishers."},{"key":"280_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F. Glover","year":"1997","unstructured":"Glover, F., & Laguna, M. (1997). Tabu search. Dordrecht: Kluwer Academic Publishers."},{"issue":"13","key":"280_CR16","doi-asserted-by":"crossref","first-page":"3031","DOI":"10.1080\/00207540050117422","volume":"38","author":"M. Gravel","year":"2000","unstructured":"Gravel, M., Price, W. L., & Gagn\u00e9, C. (2000). Scheduling jobs in an Alcan aluminum factory using a genetic algorithm. International Journal of Production Research, 38(13), 3031\u20133041.","journal-title":"International Journal of Production Research"},{"issue":"2","key":"280_CR17","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1016\/j.ejor.2005.05.018","volume":"175","author":"S. Gupta","year":"2006","unstructured":"Gupta, S., & Smith, J. (2006). Algorithms for single machine total tardiness scheduling with sequence dependent setups. European Journal of Operational Research, 175(2), 722\u2013739.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"280_CR18","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0898-1221(98)00126-6","volume":"36","author":"H. C. Hwang","year":"1998","unstructured":"Hwang, H. C., & Chang, S. Y. (1998). Parallel machines scheduling with machine shutdown. Computers & Mathematics with Applications, 36(3), 21\u201331.","journal-title":"Computers & Mathematics with Applications"},{"issue":"1","key":"280_CR19","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.dam.2004.12.002","volume":"148","author":"H. C. Hwang","year":"2005","unstructured":"Hwang, H. C., Lee, K., & Chang, S. Y. (2005). The effect of machine availability on the worst-case performance of LPT. Discrete Applied Mathematics, 148(1), 49\u201361.","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"280_CR20","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, T. C. E. (2007). Single-machine scheduling with periodic maintenance to minimize makespan. Computers & Operations Research, 34(6), 1764\u20131770.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"280_CR21","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF01178778","volume":"29","author":"C. Y. Lee","year":"1992","unstructured":"Lee, C. Y., & Liman, S. D. (1992). Single machine flow-time scheduling with scheduled maintenance. Acta Informatica, 29(4), 375\u2013382.","journal-title":"Acta Informatica"},{"issue":"9","key":"280_CR22","doi-asserted-by":"crossref","first-page":"1335","DOI":"10.1016\/S0305-0548(02)00074-6","volume":"30","author":"C. J. Liao","year":"2003","unstructured":"Liao, C. J., & Chen, W. J. (2003). Single-machine scheduling with periodic maintenance and non resumable jobs. Computers & Operations Research, 30(9), 1335\u20131347.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"280_CR23","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.camwa.2007.12.006","volume":"56","author":"Ch. Low","year":"2008","unstructured":"Low, Ch., Hsu, C.-J., & Su, C.-T. (2008). Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration. Computers & Mathematics with Applications, 56(1), 257\u2013265.","journal-title":"Computers & Mathematics with Applications"},{"key":"280_CR24","first-page":"255","volume-title":"Handbook of metaheuristics","author":"R. Mart\u00ed","year":"2002","unstructured":"Mart\u00ed, R. (2002). Multi-start methods. In F. Glover & G. A. Kochenberger (Eds.), Handbook of metaheuristics (pp. 255\u2013368). Dordrecht: Kluwer Academic Publishers."},{"key":"280_CR25","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"C. E. Miller","year":"1960","unstructured":"Miller, C. E., Tucker, A. W., & Zemlin, A. R. (1960). Integer programming formulations and traveling salesman problems. Journal of the ACM, 7, 326\u2013329.","journal-title":"Journal of the ACM"},{"issue":"5","key":"280_CR26","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1287\/opre.37.5.798","volume":"37","author":"C. L. Monma","year":"1989","unstructured":"Monma, C. L., & Potts, C. N. (1989). On the complexity of scheduling with batch setup times. Operations Research, 37(5), 798\u2013804.","journal-title":"Operations Research"},{"issue":"4","key":"280_CR27","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1016\/j.camwa.2008.11.008","volume":"57","author":"G. Mosheiov","year":"2009","unstructured":"Mosheiov, G., & Sarig, A. (2009). Scheduling a maintenance activity to minimize total weighted completion-time. Computers & Mathematics with Applications, 57(4), 619\u2013623.","journal-title":"Computers & Mathematics with Applications"},{"issue":"1","key":"280_CR28","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.ejor.2003.08.026","volume":"161","author":"Ch. Sadfi","year":"2005","unstructured":"Sadfi, Ch., Penz, B., Rapine, C., Blazewicz, J., & Formanowicz, P. (2005). An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints. European Journal of Operational Research, 161(1), 3\u201310.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"280_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(98)00367-1","volume":"121","author":"G. Schmidt","year":"2000","unstructured":"Schmidt, G. (2000). Scheduling with limited machine availability. European Journal of Operational Research, 121(1), 1\u201315.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"280_CR30","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1016\/S0305-0483(97)00024-8","volume":"25","author":"K. C. Tan","year":"1997","unstructured":"Tan, K. C., & Narasimhan, R. (1997). Minimizing tardiness on a single processor with sequence-dependent setup times: a simulated annealing approach. Omega, 25(6), 619\u2013634.","journal-title":"Omega"},{"issue":"3","key":"280_CR31","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0305-0483(99)00050-X","volume":"28","author":"K. C. Tan","year":"2000","unstructured":"Tan, K. C., Narasimhan, R., Rubin, P. A., & Ragatz, G. L. (2000). A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times. Omega, 28(3), 313\u2013326.","journal-title":"Omega"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0280-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-012-0280-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0280-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:47Z","timestamp":1559468387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-012-0280-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,4]]},"references-count":31,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["280"],"URL":"https:\/\/doi.org\/10.1007\/s10951-012-0280-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,4]]}}}