{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T06:22:05Z","timestamp":1778739725921,"version":"3.51.4"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T00:00:00Z","timestamp":1476403200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"COMEX project"},{"DOI":"10.13039\/501100002661","name":"Fonds De La Recherche Scientifique - FNRS","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s11590-016-1086-5","type":"journal-article","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T04:56:15Z","timestamp":1476420975000},"page":"1283-1292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4529-4711","authenticated-orcid":false,"given":"Federico","family":"Pagnozzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,14]]},"reference":[{"key":"1086_CR1","doi-asserted-by":"crossref","unstructured":"Dubois-Lacoste, J., L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: Effective hybrid stochastic local search algorithms for biobjective permutation flowshop scheduling. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) Hybrid Metaheuristics. Lecture Notes in Computer Science, vol. 5818, pp. 100\u2013114. Springer, Heidelberg, Germany (2009)","DOI":"10.1007\/978-3-642-04918-7_8"},{"key":"1086_CR2","doi-asserted-by":"crossref","unstructured":"Marmion, M.E., Mascia, F., L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: Automatic design of hybrid stochastic local search algorithms. In: Blesa, M.J., Blum, C., Festa, P., Roli, A., Sampels, M. (eds.) Hybrid Metaheuristics. Lecture Notes in Computer Science, vol. 7919, pp. 144\u2013158. Springer, Heidelberg, Germany (2013)","DOI":"10.1007\/978-3-642-38516-2_12"},{"key":"1086_CR3","doi-asserted-by":"crossref","unstructured":"Mascia, F., L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., St\u00fctzle, T.: From grammars to parameters: Automatic iterated greedy design for the permutation flow-shop problem with weighted tardiness. In: Pardalos, P., Nicosia, G. (eds.) Learning and Intelligent Optimization, 7th International Conference, LION 7. Lecture Notes in Computer Science, vol. 7997, pp. 321\u2013334. Springer, Heidelberg, Germany (2013)","DOI":"10.1007\/978-3-642-44973-4_36"},{"issue":"3","key":"1086_CR4","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1287\/ijoc.1070.0258","volume":"20","author":"G Minella","year":"2008","unstructured":"Minella, G., Ruiz, R., Ciavotta, M.: A review and evaluation of multiobjective algorithms for the flowshop scheduling problem. INFORMS J. Comput. 20(3), 451\u2013471 (2008)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"1086_CR5","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","volume":"91","author":"E Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutation flow-shop problem. Eur. J. Oper. Res. 91(1), 160\u2013175 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"1086_CR6","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/j.omega.2004.12.006","volume":"34","author":"R Ruiz","year":"2006","unstructured":"Ruiz, R., Maroto, C., Alcaraz, J.: Two new robust genetic algorithms for the flowshop scheduling problem. Omega 34(5), 461\u2013476 (2006)","journal-title":"Omega"},{"issue":"1","key":"1086_CR7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","volume":"47","author":"\u00c9D Taillard","year":"1990","unstructured":"Taillard, \u00c9.D.: Some efficient heuristic methods for the flow shop sequencing problem. Eur. J. Oper. Res. 47(1), 65\u201374 (1990)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"1086_CR8","doi-asserted-by":"crossref","first-page":"1350","DOI":"10.1016\/j.cor.2006.08.016","volume":"35","author":"E Vallada","year":"2008","unstructured":"Vallada, E., Ruiz, R., Minella, G.: Minimising total tardiness in the m-machine flowshop problem: a review and evaluation of heuristics and metaheuristics. Comput. Oper. Res. 35(4), 1350\u20131373 (2008)","journal-title":"Comput. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1086-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1086-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1086-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T11:58:22Z","timestamp":1568462302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1086-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,14]]},"references-count":8,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["1086"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1086-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,14]]}}}