{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:41:31Z","timestamp":1775068891255,"version":"3.50.1"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2017,2,21]],"date-time":"2017-02-21T00:00:00Z","timestamp":1487635200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010198","name":"Ministerio de Econom\u00eda, Industria y Competitividad","doi-asserted-by":"crossref","award":["TIN2016-79190-R"],"award-info":[{"award-number":["TIN2016-79190-R"]}],"id":[{"id":"10.13039\/501100010198","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100010198","name":"Ministerio de Econom\u00eda, Industria y Competitividad","doi-asserted-by":"crossref","award":["TIN2016-79190-R"],"award-info":[{"award-number":["TIN2016-79190-R"]}],"id":[{"id":"10.13039\/501100010198","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100010198","name":"Ministerio de Econom\u00eda, Industria y Competitividad","doi-asserted-by":"crossref","award":["TIN2016-79190-R"],"award-info":[{"award-number":["TIN2016-79190-R"]}],"id":[{"id":"10.13039\/501100010198","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100010198","name":"Ministerio de Econom\u00eda, Industria y Competitividad","doi-asserted-by":"crossref","award":["TIN2016-79190-R"],"award-info":[{"award-number":["TIN2016-79190-R"]}],"id":[{"id":"10.13039\/501100010198","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s10732-017-9325-1","type":"journal-article","created":{"date-parts":[[2017,2,21]],"date-time":"2017-02-21T16:51:17Z","timestamp":1487695877000},"page":"81-110","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Scatter search for minimizing weighted tardiness in a single machine scheduling with setups"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-6380-8897","authenticated-orcid":false,"given":"Miguel A.","family":"Gonz\u00e1lez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan Jos\u00e9","family":"Palacios","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Camino R.","family":"Vela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"Hern\u00e1ndez-Arauzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"key":"9325_CR1","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1287\/opre.41.4.641","volume":"41","author":"L Adler","year":"1993","unstructured":"Adler, L., Fraiman, N., Kobacker, E., Pinedo, M., Plotnitcoff, J., Wu, T.: Bpss: a scheduling system for the packaging industry. Oper. Res. 41, 641\u2013648 (1993)","journal-title":"Oper. Res."},{"key":"9325_CR2","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., Ng, C., Cheng, T., Kovalyov, M.Y.: A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187, 985\u20131032 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9325_CR3","first-page":"44","volume":"5","author":"D Anghinolfi","year":"2008","unstructured":"Anghinolfi, D., Paolucci, M.: A new ant colony optimization approach for the single machine total weighted tardiness scheduling problem. Int. J. Oper. Res. 5(1), 44\u201360 (2008)","journal-title":"Int. J. Oper. Res."},{"key":"9325_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.ejor.2007.10.044","volume":"193","author":"D Anghinolfi","year":"2009","unstructured":"Anghinolfi, D., Paolucci, M.: A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times. Eur. J. Oper. Res. 193, 73\u201385 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"9325_CR5","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1007\/s10845-009-0253-2","volume":"21","author":"W Bozejko","year":"2010","unstructured":"Bozejko, W.: Parallel path relinking method for the single machine total weighted tardiness problem with sequence-dependent setups. J. Intell. Manuf. 21, 777\u2013785 (2010)","journal-title":"J. Intell. Manuf."},{"key":"9325_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.cie.2008.11.022","volume":"57","author":"W Bozejko","year":"2009","unstructured":"Bozejko, W., Wodecki, M.: Solving permutational routing problems by population-based metaheuristics. Comput. Ind. Eng. 57, 269\u2013276 (2009)","journal-title":"Comput. Ind. Eng."},{"issue":"6","key":"9325_CR7","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1016\/j.cor.2010.09.015","volume":"38","author":"K B\u00fclb\u00fcl","year":"2011","unstructured":"B\u00fclb\u00fcl, K.: A hybrid shifting bottleneck-tabu serach heuristic for the job shop total weighted tardiness problem. Comput. Oper. Res. 38(6), 967\u2013983 (2011)","journal-title":"Comput. Oper. Res."},{"key":"9325_CR8","doi-asserted-by":"publisher","unstructured":"Cano-Belm\u00e1n, J., R\u00edos Mercado, R.Z., Bautista, J.: A scatter search based hyper-heuristic for sequencing a mixed-model assembly line. J. Heuristics 16(6), 749\u2013770 (2010)","DOI":"10.1007\/s10732-009-9118-2"},{"key":"9325_CR9","doi-asserted-by":"publisher","first-page":"3079","DOI":"10.1016\/j.asoc.2012.05.017","volume":"12","author":"C Chao","year":"2012","unstructured":"Chao, C., Liao, C.: A discrete electromagnetism-like mechanism for single machine total weighted tardiness problem with sequence-dependent setup times. Appl. Soft Comput. 12, 3079\u20133087 (2012)","journal-title":"Appl. Soft Comput."},{"key":"9325_CR10","unstructured":"Chiang, W., Fox, M., Ow, P.: Factory model and test data descriptions: opis experiments. In: Technical Reports CMU-RI-TR-90-05, The robotics institute, Carnegie Mellon University (1990)"},{"key":"9325_CR11","doi-asserted-by":"publisher","unstructured":"Cicirello, V.: Non-wrapping order crossover: an order preserving crossover operator that respects absolute position. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 1125\u20131132. Seattle, WA (2006)","DOI":"10.1145\/1143997.1144177"},{"key":"9325_CR12","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10732-005-6997-8","volume":"11","author":"V Cicirello","year":"2005","unstructured":"Cicirello, V., Smith, S.: Enhancing stochastic search performance by value-biased randomization of heuristics. J. Heuristics 11, 5\u201334 (2005)","journal-title":"J. Heuristics"},{"key":"9325_CR13","doi-asserted-by":"crossref","unstructured":"Conner, G.: 10 questions. Manuf. Eng. Mag., pp. 93\u201399 (2009)","DOI":"10.1007\/s12541-009-0076-2"},{"issue":"5","key":"9325_CR14","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10732-014-9247-0","volume":"20","author":"JW Escobar","year":"2014","unstructured":"Escobar, J.W., Linfati, R., Toth, P., Baldoquin, M.G.: A hybrid granular tabu search algorithm for the multi-depot vehicle routing problem. J. Heuristics 20(5), 483\u2013509 (2014)","journal-title":"J. Heuristics"},{"key":"9325_CR15","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1057\/palgrave.jors.2601390","volume":"53","author":"C Gagn\u00e9","year":"2002","unstructured":"Gagn\u00e9, C., Price, W., Gravel, M.: Comparing an aco algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times. J. Oper. Res. Soc. 53, 895\u2013906 (2002)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"9325_CR16","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8(1), 156\u2013166 (1977)","journal-title":"Decis. Sci."},{"key":"9325_CR17","first-page":"13","volume-title":"Artificial Evolution, vol. 1363 of Lecture Notes in Computer Science","author":"F Glover","year":"1998","unstructured":"Glover, F.: A template for scatter search and path relinking. In: Hao, J., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds.) Artificial Evolution, vol. 1363 of Lecture Notes in Computer Science, pp. 13\u201354. Springer, Berlin (1998)"},{"key":"9325_CR18","doi-asserted-by":"publisher","first-page":"2097","DOI":"10.1007\/s00500-012-0880-y","volume":"16","author":"MA Gonz\u00e1lez","year":"2012","unstructured":"Gonz\u00e1lez, M.A., Gonz\u00e1lez-Rodr\u00edguez, I., Vela, C., Varela, R.: An efficient hybrid evolutionary algorithm for scheduling with setup times and weighted tardiness minimization. Soft Comput. 16, 2097\u20132113 (2012)","journal-title":"Soft Comput."},{"key":"9325_CR19","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.cor.2015.02.005","volume":"60","author":"MA Gonz\u00e1lez","year":"2015","unstructured":"Gonz\u00e1lez, M.A., Oddi, A., Rasconi, R., Varela, R.: Scatter search with path relinking for the job shop with time lags and setup times. Comput. Oper. Res. 60, 37\u201354 (2015a)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9325_CR20","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ejor.2015.02.052","volume":"245","author":"MA Gonz\u00e1lez","year":"2015","unstructured":"Gonz\u00e1lez, M.A., Vela, C.R., Varela, R.: Scatter search with path relinking for the flexible job shop scheduling problem. Eur. J. Oper. Res. 245(1), 35\u201345 (2015b)","journal-title":"Eur. J. Oper. Res."},{"key":"9325_CR21","doi-asserted-by":"crossref","first-page":"179","DOI":"10.3233\/AIC-140631","volume":"28","author":"MA Gonz\u00e1lez","year":"2015","unstructured":"Gonz\u00e1lez, M.A., Vela, C.R., Varela, R., Gonz\u00e1lez-Rodr\u00edguez, I.: An advanced scatter search algorithm for solving job shops with sequence dependent and non-anticipatory setups. AI Commun. 28, 179\u2013193 (2015c)","journal-title":"AI Commun."},{"key":"9325_CR22","doi-asserted-by":"crossref","unstructured":"Gonz\u00e1lez Rodr\u00edguez, I., Vela, C.R., Hern\u00e1ndez-Arauzo, A., Puente, J.: Improved local search for job shop scheduling with uncertain durations. In: Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling (ICAPS-2009), pp. 154\u2013161. AAAI Press, Thesaloniki (2009)","DOI":"10.1609\/icaps.v19i1.13371"},{"key":"9325_CR23","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"4","author":"R Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J., Rinnooy Kan, A.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 4, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"key":"9325_CR24","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1287\/opre.29.4.646","volume":"29","author":"S Graves","year":"1981","unstructured":"Graves, S.: A review of production scheduling. Oper. Res. 29, 646\u2013675 (1981)","journal-title":"Oper. Res."},{"key":"9325_CR25","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.asoc.2014.12.030","volume":"29","author":"Q Guo","year":"2015","unstructured":"Guo, Q., Tang, L.: An improved scatter search algorithm for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times. Appl. Soft Comput. 29, 184\u2013195 (2015)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"9325_CR26","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1016\/j.eswa.2011.08.034","volume":"39","author":"O Iba\u00f1ez","year":"2012","unstructured":"Iba\u00f1ez, O., Cord\u00f3n, O., Damas, S., Santamar\u00eda, J.: An advanced scatter search design for skull-face overlay in craniofacial superimposition. Expert Syst. Appl. 39(1), 1459\u20131473 (2012)","journal-title":"Expert Syst. Appl."},{"key":"9325_CR27","doi-asserted-by":"publisher","first-page":"1506","DOI":"10.1016\/j.cor.2011.08.022","volume":"39","author":"G Kirlik","year":"2012","unstructured":"Kirlik, G., Oguz, C.: A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine. Comput. Oper. Res. 39, 1506\u20131520 (2012)","journal-title":"Comput. Oper. Res."},{"key":"9325_CR28","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10898-013-0061-2","volume":"58","author":"M Laguna","year":"2014","unstructured":"Laguna, M., Gort\u00e1zar, F., Gallego, M., Duarte, A., Mart\u00ed, R.: A black-box scatter search for optimization problems with integer variables. J. Global Optim. 58, 497\u2013516 (2014)","journal-title":"J. Global Optim."},{"key":"9325_CR29","volume-title":"Scatter Search: Methodology and Implementations in C","author":"M Laguna","year":"2012","unstructured":"Laguna, M., Mart\u00ed, R.: Scatter Search: Methodology and Implementations in C. Operations Research\/Computer Science Interfaces Series. Springer, New York (2012)"},{"key":"9325_CR30","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"E Lawler","year":"1977","unstructured":"Lawler, E.: A \u2019pseudopolynomial\u2019 algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math. 1, 331\u2013342 (1977)","journal-title":"Ann. Discrete Math."},{"key":"9325_CR31","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1080\/07408179708966311","volume":"29","author":"Y Lee","year":"1997","unstructured":"Lee, Y., Bhaskaran, K., Pinedo, M.: A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Trans. 29, 45\u201352 (1997)","journal-title":"IIE Trans."},{"key":"9325_CR32","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J Lenstra","year":"1977","unstructured":"Lenstra, J., Rinnooy Kan, A., Brucker, P.: Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343\u2013362 (1977)","journal-title":"Ann. Discrete Math."},{"key":"9325_CR33","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1016\/j.cor.2005.07.020","volume":"34","author":"C Liao","year":"2007","unstructured":"Liao, C., Juan, H.: An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups. Comput. Oper. Res. 34, 1899\u20131909 (2007)","journal-title":"Comput. Oper. Res."},{"key":"9325_CR34","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.tcs.2012.01.043","volume":"434","author":"C Liao","year":"2012","unstructured":"Liao, C., Tsou, H., Huang, K.: Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups. Theor. Comput. Sci. 434, 45\u201352 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"11\u201312","key":"9325_CR35","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1007\/s00170-006-0693-1","volume":"34","author":"S Lin","year":"2007","unstructured":"Lin, S., Ying, K.: Solving single-machine total weighted tardiness problems with sequence-dependent setup times by meta-heuristics. Int. J. Adv. Manuf. Technol. 34(11\u201312), 1183\u20131190 (2007)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"9325_CR36","doi-asserted-by":"publisher","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated Local Search, pp. 320\u2013353. Springer, Boston (2003)","DOI":"10.1007\/0-306-48056-5_11"},{"key":"9325_CR37","doi-asserted-by":"publisher","unstructured":"Luo, J., Hu, Y.: A new grasp and path relinking for single machine scheduling with sequence dependent setups. In: Proceedings of 2013 10th IEEE International Conference on Control and Automation (ICCA), pp. 490\u2013495 (2013)","DOI":"10.1109\/ICCA.2013.6565014"},{"issue":"2","key":"9325_CR38","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.ejor.2014.05.024","volume":"239","author":"B Naderi","year":"2014","unstructured":"Naderi, B., Ruiz, R.: A scatter search algorithm for the distributed permutation flowshop scheduling problem. Eur. J. Oper. Res. 239(2), 323\u2013334 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"9\u201312","key":"9325_CR39","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1007\/s00170-011-3441-0","volume":"58","author":"M Nasiri","year":"2012","unstructured":"Nasiri, M., Kianfar, F.: A guided tabu search\/path relinking algorithm for the job shop problem. Int. J. Adv. Manuf. Technol. 58(9\u201312), 1105\u20131113 (2012)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"4","key":"9325_CR40","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1109\/TEVC.2007.913109","volume":"12","author":"AJ Nebro","year":"2008","unstructured":"Nebro, A.J., Luna, F., Alba, E., Dorronsoro, B., Durillo, J.J., Beham, A.: Abyss: adapting scatter search to multiobjective optimization. IEEE Trans. Evolut. Comput. 12(4), 439\u2013457 (2008)","journal-title":"IEEE Trans. Evolut. Comput."},{"issue":"4","key":"9325_CR41","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10732-014-9244-3","volume":"20","author":"PK Nguyen","year":"2014","unstructured":"Nguyen, P.K., Crainic, T.G., Toulouse, M.: A hybrid generational genetic algorithm for the periodic vehicle routing problem with time windows. J. Heuristics 20(4), 383\u2013416 (2014)","journal-title":"J. Heuristics"},{"issue":"2","key":"9325_CR42","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10951-005-6364-5","volume":"8","author":"E Nowicki","year":"2005","unstructured":"Nowicki, E., Smutnicki, C.: An advanced tabu search algorithm for the job shop problem. J. Sched. 8(2), 145\u2013159 (2005)","journal-title":"J. Sched."},{"issue":"2","key":"9325_CR43","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.ejor.2004.08.021","volume":"169","author":"E Nowicki","year":"2006","unstructured":"Nowicki, E., Smutnicki, C.: Some aspects of scatter search in the flow-shop problem. Eur. J. Oper. Res. 169(2), 654\u2013666 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9325_CR44","doi-asserted-by":"publisher","unstructured":"Palacios, J.J., Gonz\u00e1lez-Rodr\u00edguez, I., Vela, C.R., Puente, J.: Robust multiobjective optimisation for fuzzy job shops problems. Appl. Soft Comput. (2016). doi: 10.1016\/j.asoc.2016.07.004","DOI":"10.1016\/j.asoc.2016.07.004"},{"issue":"1","key":"9325_CR45","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10479-011-0907-2","volume":"199","author":"JJ Pantrigo","year":"2012","unstructured":"Pantrigo, J.J., Mart\u00ed, R., Duarte, A., Pardo, E.G.: Scatter search for the cutwidth minimization problem. Ann. Oper. Res. 199(1), 285\u2013304 (2012)","journal-title":"Ann. Oper. Res."},{"key":"9325_CR46","doi-asserted-by":"publisher","unstructured":"Panwalkar, S., Dudek, R., Smith, M.: Sequencing research and the industrial scheduling problem. In: Symposium on the Theory of Scheduling and Its Applications. Springer, New York, pp. 29\u201338 (1973)","DOI":"10.1007\/978-3-642-80784-8_2"},{"key":"9325_CR47","unstructured":"Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems. Prentice Hall, Upper Saddle River (1995)"},{"issue":"3","key":"9325_CR48","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10732-013-9221-2","volume":"19","author":"A Rahimi-Vahed","year":"2013","unstructured":"Rahimi-Vahed, A., Crainic, T., Gendreau, M., Rei, W.: A path relinking algorithm for a multi-depot periodic vehicle routing problem. J. Heuristics 19(3), 497\u2013524 (2013)","journal-title":"J. Heuristics"},{"key":"9325_CR49","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/0377-2217(89)90332-9","volume":"40","author":"N Raman","year":"1989","unstructured":"Raman, N., Rachamadugu, R., Talbot, F.: Real-time scheduling of an automated manufacturing center. Eur. J. Oper. Res. 40, 222\u2013242 (1989)","journal-title":"Eur. J. Oper. Res."},{"key":"9325_CR50","doi-asserted-by":"crossref","unstructured":"Resende, M.G., Ribeiro, C.C., Glover, F., Mart\u00ed, R.: Scatter Search and Path-Relinking: Fundamentals, Advances, and Applications, pp. 87\u2013107. Springer, Boston (2010)","DOI":"10.1007\/978-1-4419-1665-5_4"},{"issue":"1","key":"9325_CR51","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0305-0548(93)E0021-K","volume":"22","author":"P Rubin","year":"1995","unstructured":"Rubin, P., Ragatz, G.: Scheduling in a sequence dependent setup environment with genetic search. Comput. Oper. Res. 22(1), 85\u201399 (1995)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9325_CR52","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.ejor.2004.04.017","volume":"165","author":"R Ruiz","year":"2005","unstructured":"Ruiz, R., Maroto, C.: A comprehensive review and evaluation of permutation flowshop heuristics. Eur. J. Oper. Res. 165(2), 479\u2013494 (2005)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9325_CR53","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.ejor.2004.08.018","volume":"169","author":"RA Russell","year":"2006","unstructured":"Russell, R.A., Chiang, W.-C.: Scatter search for the vehicle routing problem with time windows. Eur. J. Oper. Res. 169(2), 606\u2013622 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9325_CR54","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0305-0483(84)90011-2","volume":"12","author":"T Sen","year":"1984","unstructured":"Sen, T., Gupta, S.: A state-of-art survey of static scheduling research involving due date. OMEGA 12, 63\u201376 (1984)","journal-title":"OMEGA"},{"issue":"9","key":"9325_CR55","doi-asserted-by":"publisher","first-page":"2729","DOI":"10.1080\/00207543.2014.883472","volume":"52","author":"A Subramanian","year":"2014","unstructured":"Subramanian, A., Battarra, M., Potts, C.: An iterated local search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times. Int. J. Prod. Res. 52(9), 2729\u20132742 (2014)","journal-title":"Int. J. Prod. Res."},{"key":"9325_CR56","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.cor.2012.07.004","volume":"40","author":"S Tanaka","year":"2013","unstructured":"Tanaka, S., Araki, M.: An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times. Comput. Oper. Res. 40, 344\u2013352 (2013)","journal-title":"Comput. Oper. Res."},{"key":"9325_CR57","doi-asserted-by":"publisher","first-page":"1900","DOI":"10.1016\/j.cor.2008.06.007","volume":"36","author":"MF Tasgetiren","year":"2009","unstructured":"Tasgetiren, M.F., Pan, Q.-K., Liang, Y.-C.: A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times. Comput. Oper. Res. 36, 1900\u20131915 (2009)","journal-title":"Comput. Oper. Res."},{"key":"9325_CR58","doi-asserted-by":"publisher","first-page":"2388","DOI":"10.1016\/j.cor.2006.11.004","volume":"35","author":"J Valente","year":"2008","unstructured":"Valente, J., Alves, R.: Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups. Comput. Oper. Res. 35, 2388\u20132405 (2008)","journal-title":"Comput. Oper. Res."},{"key":"9325_CR59","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10732-008-9094-y","volume":"16","author":"CR Vela","year":"2010","unstructured":"Vela, C.R., Varela, R., Gonz\u00e1lez, M.A.: Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times. J. Heuristics 16, 139\u2013165 (2010)","journal-title":"J. Heuristics"},{"issue":"9","key":"9325_CR60","doi-asserted-by":"publisher","first-page":"1624","DOI":"10.1016\/j.cor.2009.12.010","volume":"37","author":"X Wang","year":"2010","unstructured":"Wang, X., Tang, L.: A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times. Comput. Oper. Res. 37(9), 1624\u20131640 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"9325_CR61","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/mnsc.16.4.B274","volume":"16","author":"J Wilbrecht","year":"1969","unstructured":"Wilbrecht, J., Prescott, W.: The influence of setup time on job shop performance. Manag. Sci. 16(4), 391\u2013401 (1969)","journal-title":"Manag. Sci."},{"issue":"3","key":"9325_CR62","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10951-013-0351-z","volume":"17","author":"H Xu","year":"2014","unstructured":"Xu, H., Lu, Z., Cheng, T.: Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness. J. Sched. 17(3), 271\u2013287 (2014a)","journal-title":"J. Sched."},{"key":"9325_CR63","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.cor.2014.04.009","volume":"50","author":"H Xu","year":"2014","unstructured":"Xu, H., Lu, Z., Yin, A., Shen, L., Buscher, U.: A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times. Comput. Oper. Res. 50, 47\u201360 (2014b)","journal-title":"Comput. Oper. Res."},{"key":"9325_CR64","doi-asserted-by":"publisher","unstructured":"Yamada, T., Nakano, R.: Scheduling by genetic local search with multi-step crossover. In: Proceedings of Fourth International Conference On Parallel Problem Solving from Nature (PPSN IV 1996), pp. 960\u2013969 (1996)","DOI":"10.1007\/3-540-61723-X_1059"},{"key":"9325_CR65","doi-asserted-by":"publisher","first-page":"7087","DOI":"10.1016\/j.eswa.2008.08.033","volume":"36","author":"K Ying","year":"2009","unstructured":"Ying, K., Lin, S., Huang, C.: Sequencing single-machine tardiness problems with sequence dependent setup times using an iterated greedy heuristic. Expert Syst. Appl. 36, 7087\u20137092 (2009)","journal-title":"Expert Syst. Appl."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/article\/10.1007\/s10732-017-9325-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9325-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9325-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T09:15:20Z","timestamp":1692695720000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/10.1007\/s10732-017-9325-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,21]]},"references-count":65,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["9325"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s10732-017-9325-1","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,21]]}}}