{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:41:48Z","timestamp":1775068908686,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,1,3]],"date-time":"2020-01-03T00:00:00Z","timestamp":1578009600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,3]],"date-time":"2020-01-03T00:00:00Z","timestamp":1578009600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100005674","name":"FUNDEP","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005674","id-type":"DOI","asserted-by":"crossref"}]},{"name":"CNPQ"},{"DOI":"10.13039\/501100004901","name":"FAPEMIG","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004901","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s11590-019-01525-7","type":"journal-article","created":{"date-parts":[[2020,1,3]],"date-time":"2020-01-03T11:04:56Z","timestamp":1578049496000},"page":"59-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A hybrid VNS-Lagrangean heuristic framework applied on single machine scheduling problem with sequence-dependent setup times, release dates and due dates"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6602-8458","authenticated-orcid":false,"given":"Thiago Henrique","family":"Nogueira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helena Louren\u00e7o","family":"Ramalhinho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos R. V.","family":"de Carvalho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mart\u00edn","family":"G\u00f3mez Ravetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,3]]},"reference":[{"issue":"3","key":"1525_CR1","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F Barahona","year":"2000","unstructured":"Barahona, F., Anbil, R.: The volume algorithm: producing primal solutions with a subgradient method. Math. Program. 87(3), 385\u2013399 (2000)","journal-title":"Math. Program."},{"key":"1525_CR2","doi-asserted-by":"crossref","unstructured":"Bartz-Beielstein, T.: Spot: An R package for automatic and interactive tuning of optimization algorithms by sequential parameter optimization (2010). arXiv preprint arXiv:1006.4645","DOI":"10.1007\/978-3-642-02538-9_14"},{"issue":"6","key":"1525_CR3","doi-asserted-by":"publisher","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C Blum","year":"2011","unstructured":"Blum, C., Puchinger, J., Raidl, G.R., Roli, A.: Hybrid metaheuristics in combinatorial optimization: a survey. Appl. Soft Comput. 11(6), 4135\u20134151 (2011)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"1525_CR4","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10732-007-9064-9","volume":"15","author":"M Boschetti","year":"2009","unstructured":"Boschetti, M., Maniezzo, V.: Benders decomposition, Lagrangean relaxation and metaheuristic design. J. Heuristics 15(3), 283\u2013312 (2009)","journal-title":"J. Heuristics"},{"key":"1525_CR5","doi-asserted-by":"crossref","unstructured":"Boschetti, M., Maniezzo, V., Roffilli, M.: Decomposition techniques as metaheuristic frameworks. In: Matheuristics, pp. 135\u2013158. Springer (2010)","DOI":"10.1007\/978-1-4419-1306-7_5"},{"issue":"2","key":"1525_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s11590-015-0973-5","volume":"11","author":"J Brimberg","year":"2017","unstructured":"Brimberg, J., Mladenovi\u0107, N., Todosijevi\u0107, R., Uro\u0161evi\u0107, D.: A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem. Optim. Lett. 11(2), 313\u2013327 (2017)","journal-title":"Optim. Lett."},{"issue":"2","key":"1525_CR7","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s11590-016-1004-x","volume":"11","author":"J Brimberg","year":"2017","unstructured":"Brimberg, J., Mladenovi\u0107, N., Todosijevi\u0107, R., Uro\u0161evi\u0107, D.: General variable neighborhood search for the uncapacitated single allocation p-hub center problem. Optim. Lett. 11(2), 377\u2013388 (2017)","journal-title":"Optim. Lett."},{"issue":"5","key":"1525_CR8","doi-asserted-by":"publisher","first-page":"938","DOI":"10.1016\/j.cor.2009.07.006","volume":"37","author":"MR de Paula","year":"2010","unstructured":"de Paula, M.R., Mateus, G.R., Ravetti, M.G.: A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times. Comput. Oper. Res. 37(5), 938\u2013949 (2010)","journal-title":"Comput. Oper. Res."},{"key":"1525_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1093\/imaman\/dpm016","volume":"18","author":"MR de Paula","year":"2007","unstructured":"de Paula, M.R., Ravetti, M.G., Mateus, G.R.: Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search. IMA J. Manag. Math. 18, 101\u2013115 (2007)","journal-title":"IMA J. Manag. Math."},{"key":"1525_CR10","doi-asserted-by":"publisher","first-page":"1114","DOI":"10.1287\/opre.21.5.1114","volume":"21","author":"ML Fisher","year":"1973","unstructured":"Fisher, M.L.: Optimal solution of scheduling problems using lagrange multipliers: Part I. Oper. Res. 21, 1114\u20131127 (1973)","journal-title":"Oper. Res."},{"key":"1525_CR11","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.ejor.2018.11.033","volume":"275","author":"G Fonseca","year":"2018","unstructured":"Fonseca, G., Nogueira, T., Ravetti, M.: A hybrid lagrangian metaheuristic for the cross-docking flow shop scheduling problem. Eur. J. Oper. Res. 275, 139\u2013154 (2018). https:\/\/doi.org\/10.1016\/j.ejor.2018.11.033","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"1525_CR12","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1057\/palgrave.jors.2601868","volume":"56","author":"C Gagn\u00e9","year":"2005","unstructured":"Gagn\u00e9, C., Gravel, M., Price, W.: Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems. J. Oper. Res. Soc. 56(6), 687\u2013698 (2005)","journal-title":"J. Oper. Res. Soc."},{"key":"1525_CR13","doi-asserted-by":"crossref","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. pp. 895\u2013906 (2002)","DOI":"10.1057\/palgrave.jors.2601390"},{"key":"1525_CR14","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovi\u0107, N.: An introduction to variable neighborhood search. In: Meta-heuristics, pp. 433\u2013458. Springer (1999)","DOI":"10.1007\/978-1-4615-5775-3_30"},{"key":"1525_CR15","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search. In: Search methodologies, pp. 313\u2013337. Springer (2014)","DOI":"10.1007\/978-1-4614-6940-7_12"},{"issue":"7","key":"1525_CR16","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(7), 1506\u20131520 (2012)","journal-title":"Comput. Oper. Res."},{"key":"1525_CR17","doi-asserted-by":"crossref","unstructured":"Lemar\u00e9chal, C.: An extension of davidon methods to non differentiable problems. In: Nondifferentiable Optimization, pp. 95\u2013109. Springer (1975)","DOI":"10.1007\/BFb0120700"},{"key":"1525_CR18","doi-asserted-by":"crossref","unstructured":"Lemar\u00e9chal, C.: Nondifferentiable optimization. In: Nemhauser, G.L., Rinnooy Kan, A.H.G., Todd, M.J. (eds.) Hanbooks in Operations Research, pp. 529\u2013572. North Holland, New York (1989)","DOI":"10.1016\/S0927-0507(89)01008-X"},{"issue":"1","key":"1525_CR19","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10479-005-3977-1","volume":"140","author":"A Lucena","year":"2005","unstructured":"Lucena, A.: Non delayed relax-and-cut algorithms. Ann. Oper. Res. 140(1), 375\u2013410 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"1525_CR20","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.ejor.2017.03.031","volume":"261","author":"Y Marinakis","year":"2017","unstructured":"Marinakis, Y., Migdalas, A., Sifaleras, A.: A hybrid particle swarm optimization-variable neighborhood search algorithm for constrained shortest path problems. Eur. J. Oper. Res. 261(3), 819\u2013834 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1525_CR21","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore Jr., E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1), 91\u201395 (1983)","journal-title":"Omega"},{"key":"1525_CR22","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1590\/0101-7438.2019.039.01.0109","volume":"39","author":"TH Nogueira","year":"2019","unstructured":"Nogueira, T.H., Carvalho, C., Ravetti, M.G., Souza, M.: Analysis of mixed integer programming formulations for single machine scheduling problems with sequence dependent setup times and release dates. Pesquisa Oper. 39, 109\u2013154 (2019)","journal-title":"Pesquisa Oper."},{"key":"1525_CR23","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s12532-010-0019-z","volume":"2","author":"A Pessoa","year":"2010","unstructured":"Pessoa, A., Uchoa, E., Arag\u00e3o, M., Rodrigues, R.: Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems. Math. Program. Comput. 2, 259\u2013290 (2010)","journal-title":"Math. Program. Comput."},{"key":"1525_CR24","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"ML Pinedo","year":"2008","unstructured":"Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems. Springer, Berlin (2008)"},{"key":"1525_CR25","doi-asserted-by":"crossref","unstructured":"Pirkwieser, S., Raidl, G.R.: Boosting a variable neighborhood search for the periodic vehicle routing problem with time windows by ilp techniques. In: Proceedings of the 8th Metaheuristic International Conference, Hamburg, Germany, pp. 33\u201335 (2009)","DOI":"10.1007\/978-3-642-04918-7_4"},{"key":"1525_CR26","doi-asserted-by":"crossref","unstructured":"Pirkwieser, S., Raidl, G.R., Gottlieb, J.: Improved packing and routing of vehicles with compartments. In: Computer Aided Systems Theory\u2013EUROCAST 2011, pp. 392\u2013399. Springer (2011)","DOI":"10.1007\/978-3-642-27549-4_50"},{"key":"1525_CR27","doi-asserted-by":"crossref","unstructured":"Pirkwieser, S., Raidl, G.R., Puchinger, J.: Combining lagrangian decomposition with an evolutionary algorithm for the knapsack constrained maximum spanning tree problem. In: Evolutionary Computation in Combinatorial Optimization, pp. 176\u2013187. Springer (2007)","DOI":"10.1007\/978-3-540-71615-0_16"},{"issue":"1","key":"1525_CR28","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0305-0548(93)E0021-K","volume":"22","author":"PA Rubin","year":"1995","unstructured":"Rubin, P.A., Ragatz, G.L.: Scheduling in a sequence dependent setup environment with genetic search. Comput. Oper. Res. 22(1), 85\u201399 (1995)","journal-title":"Comput. Oper. Res."},{"key":"1525_CR29","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01586059","volume":"54","author":"JP Sousa","year":"1992","unstructured":"Sousa, J.P., Wolsey, L.A.: A time indexed formulation of non-preemptive single machine scheduling problems. Math. Program. 54, 353\u2013367 (1992)","journal-title":"Math. Program."},{"issue":"9","key":"1525_CR30","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.N.: 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."},{"issue":"6","key":"1525_CR31","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1007\/s11590-015-0867-6","volume":"11","author":"R Todosijevi\u0107","year":"2017","unstructured":"Todosijevi\u0107, R., Uro\u0161evi\u0107, D., Mladenovi\u0107, N., Hanafi, S.: A general variable neighborhood search for solving the uncapacitated $$r$$-allocation $$p$$-hub median problem. Optim. Lett. 11(6), 1109\u20131121 (2017)","journal-title":"Optim. Lett."},{"key":"1525_CR32","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 (2014)","journal-title":"Comput. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01525-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-019-01525-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01525-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T11:38:59Z","timestamp":1641814739000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-019-01525-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,3]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["1525"],"URL":"https:\/\/doi.org\/10.1007\/s11590-019-01525-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,3]]},"assertion":[{"value":"31 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}