{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T23:31:44Z","timestamp":1767915104715,"version":"3.49.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T00:00:00Z","timestamp":1164931200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2006,12]]},"DOI":"10.1007\/s10732-006-6662-x","type":"journal-article","created":{"date-parts":[[2006,10,24]],"date-time":"2006-10-24T16:41:28Z","timestamp":1161708088000},"page":"427-446","source":"Crossref","is-referenced-by-count":11,"title":["Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times"],"prefix":"10.1007","volume":"12","author":[{"given":"Vin\u00edcius Amaral","family":"Armentano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olinto C\u00e9sar Bassi de","family":"Araujo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6662_CR1","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.ejor.2003.08.066","volume":"162","author":"S. Ahmadi","year":"2005","unstructured":"Ahmadi, S. and I.H. Osman. (2005). \u201cGreedy Random Adaptive Memory Programming search for the Capacitated Clustering Problem.\u201d European Journal of Operational Research 162, 30\u201344.","journal-title":"European Journal of Operational Research"},{"key":"6662_CR2","doi-asserted-by":"crossref","unstructured":"Aiex, R.M., M.G.C. Resende, P.M. Pardalos, and G. Toraldo. (2005). \u201cGRASP with Path Relinking for the Three-Index Assignment Problem.\u201d INFORMS Journal on Computing 17, 224\u2013247.","DOI":"10.1287\/ijoc.1030.0059"},{"key":"6662_CR3","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","volume":"27","author":"A. Allahverdi","year":"1999","unstructured":"Allahverdi, A., J.N.D. Gupta, and T. Aldowaisan. (1999). \u201cA Review of Scheduling Research Involving Setup Considerations,\u201d OMEGA 27, 219\u2013239.","journal-title":"OMEGA"},{"key":"6662_CR4","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1080\/095372800432188","volume":"11","author":"V.A. Armentano","year":"2000","unstructured":"Armentano, V.A. and R. Mazzini. (2000). \u201cA Genetic Algorithm for Scheduling on a Single Machine with Setup Times and Due Dates.\u201d Production Planning & Control 11, 713\u2013120.","journal-title":"Production Planning & Control"},{"key":"6662_CR5","unstructured":"Binato, S., J. Hery, D.M. Loewenstern, and M.G.C. Resende. (2002). \u201cA Greedy Randomized Adaptive Search Procedure for Job Shop Scheduling.\u201d In Ribeiro P. Hansen (ed.), Essays and Surveys on Metaheuristics Essays and Surveys on Metaheuristics C.C., Kluwer, pp. 58\u201379."},{"key":"6662_CR6","unstructured":"Bresina, J.L. (1996). \u201cHeuristic-Biased Stochastic Sampling.\u201d In Proceedings of the AAAI\u201996 Conference, pp. 271\u2013278."},{"key":"6662_CR7","unstructured":"Christofoletti, L.M. (2002). M\u00e9todos de Re\u00ednicio Aplicados ao Problema de Seq\u00fcenciamento em Uma m\u00e1quina Com Tempos de Prepara\u00e7\u00e3o e Datas de Entrega, Disserta\u00e7\u00e3o de Mestrado, In Portuguese, Faculdade de Engenharia El\u00e9trica e de Computa\u00e7\u00e3o, Universidade Estadual de Campinas, Brasil."},{"key":"6662_CR8","doi-asserted-by":"crossref","unstructured":"Cirasella, J., D.S., Johnson, L.A. McGeoch, and W. Zhang. (2001). \u201cThe Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests.\u201d In A.L. Buchsbaum and J. Snoeyink (eds.), ALENEX 2001 Proceedings, Springer Lecture Notes in Computer Science 2153, pp. 32\u201359.","DOI":"10.1007\/3-540-44808-X_3"},{"key":"6662_CR9","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J. Du","year":"1990","unstructured":"Du, J. and J.Y.T. Leung. (1990). \u201cMinimizing Total Tardiness on one Machine is NP-Hard.\u201d Mathematics of Operations Research 15, 483\u2013495.","journal-title":"Mathematics of Operations Research"},{"key":"6662_CR10","first-page":"1","volume":"2","author":"T. Feo","year":"1995","unstructured":"Feo, T. and M. Resende. (1995). \u201cGreedy Randomized Adaptive Search Procedures.\u201d Journal of Global Optimization 2, 1\u201327.","journal-title":"Journal of Global Optimization"},{"key":"6662_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.endm.2005.05.007","volume":"19","author":"E.R. Fernandes","year":"2005","unstructured":"Fernandes, E.R. and C.C. Ribeiro. (2005). \u201cA Multistart Constructive Heuristic for Sequencing by Hybridization Using Adaptive Memory.\u201d Electronic Notes in Discrete Mathematics 19, 41\u201347.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"6662_CR12","unstructured":"Festa, P. and M.M.G.C. Resende. (2004). \u201cAn Annotated Bibliography of GRASP.\u201d European Journal of Operational Research, submitted."},{"key":"6662_CR13","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1287\/ijoc.11.2.198","volume":"11","author":"C. Fleurent","year":"1999","unstructured":"Fleurent, C. and F. Glover. (1999). \u201cImproved Constructive Multistart Strategies for the Quadratic Assignment Problem.\u201d INFORMS Journal on Computing 11, 198\u2013204.","journal-title":"INFORMS Journal on Computing"},{"key":"6662_CR14","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0377-2217(00)00140-5","volume":"132","author":"P.M. Francca","year":"2001","unstructured":"Fran\u00e7a, P.M., A. Mendes, and P. Moscato. (2001). \u201cA Memetic Algorithm for the Total Tardiness Single Machine Scheduling Pproblem.\u201d European Journal of Operational Research 132, 224\u2013242.","journal-title":"European Journal of Operational Research"},{"key":"6662_CR15","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1057\/palgrave.jors.2601390","volume":"53","author":"C. Gagn\u00e9","year":"2002","unstructured":"Gagn\u00e9, C., W.L. Price, and M. Gravel. (2002). \u201cComparing an ACO Algorithm With Other Heuristics for the Single Machine Problem with Sequence Dependent Setup Times.\u201d Journal of the Operational Research Society 53, 895\u2013906.","journal-title":"Journal of the Operational Research Society"},{"key":"6662_CR16","unstructured":"Glover, F. (1996). \u201cTabu Search and Adaptive Memory Programming\u2014Advances, Applications and Challenges.\u201d In R.S. Barr, R.V. Helgason and J.L. Kennington (eds.), Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, Kluwer, pp. 1\u201375."},{"key":"6662_CR17","doi-asserted-by":"crossref","unstructured":"Glover, F. and M. Laguna. (1997). Tabu Search, Kluwer.","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"6662_CR18","unstructured":"Glover, F. (1998). \u201cA Template for Scatter Search and Path Relinking, in Artificial Evolution.\u201d In J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer and D. Snyers (eds.), Lecture Notes in Computer Science, Springer 1363, pp. 13\u201354."},{"key":"6662_CR19","first-page":"653","volume":"29","author":"F. Glover","year":"2000","unstructured":"Glover, F., M. Laguna, and R. Mart\u00ed. (2000). \u201cFundamentals of Scatter Search and Path Relinking.\u201d Control and Cybernetics 29, 653\u2013684.","journal-title":"Control and Cybernetics"},{"key":"6662_CR20","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0957-4174(93)90056-C","volume":"6","author":"M. Laguna","year":"1993","unstructured":"Laguna, M. and F. Glover. (1993). \u201cIntegrating Target Analysis and Tabu Search for Improved Scheduling Systems.\u201d Expert Systems with Applications 6, 287\u2013297.","journal-title":"Expert Systems with Applications"},{"key":"6662_CR21","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M. Laguna","year":"1999","unstructured":"Laguna, M. and R. Mart\u00ed. (1999). \u201cGRASP with Path Relinking for 2-layer Straight line Crossing Minimization.\u201d INFORMS Journal on Computing 11, 44\u201352.","journal-title":"INFORMS Journal on Computing"},{"key":"6662_CR22","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1080\/07408179708966311","volume":"29","author":"Y.H. Lee","year":"1997","unstructured":"Lee, Y.H., K. Bhaskaran, and M. Pinedo. (1997). \u201cA Heuristic to Minimize the Total Weighted Tardiness with Sequence-Dependent Setups.\u201d IIE Transactions 29, 45\u201352.","journal-title":"IIE Transactions"},{"key":"6662_CR23","doi-asserted-by":"crossref","unstructured":"Panwalkar, S.S., R.A. Dudek, and M.L. Smith. (1973). \u201cSequencing Research and the Industrial Scheduling Problem.\u201d In S.E. Elmaghraby (ed.), Symposium on the Theory of Scheduling and Its Applications, Springer, Berlin.","DOI":"10.1007\/978-3-642-80784-8_2"},{"key":"6662_CR24","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/ijoc.12.3.164.12639","volume":"12","author":"M. Prais","year":"2000","unstructured":"Prais, M. and C.C. Ribeiro. (2000). Reactive GRASP: \u201cAn Application to a Matrix Decomposition Problem in TDMA Traffic Assignment.\u201d INFORMS Journal on Computing 12, 164\u2013176.","journal-title":"INFORMS Journal on Computing"},{"key":"6662_CR25","unstructured":"Ragatz, C.L. (1993). \u201cA Branch-and-bound Method for Minimum Tardiness Sequencing on a Single Processor with Sequence Dependent Setup Times.\u201d In Proceedings: Twenty-fourth Annual Meeting of The Decision Sciences Institute, 1375\u20131377."},{"key":"6662_CR26","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/0377-2217(89)90332-9","volume":"40","author":"N. Raman","year":"1989","unstructured":"Raman, N., R. V. Rachamaduguru, and F.B. Talbot. (1989). \u201cReal Time Scheduling of an Automated Manufacturing Center.\u201d European Journal of Operational Research 40, 222\u2013242.","journal-title":"European Journal of Operational Research"},{"key":"6662_CR27","doi-asserted-by":"crossref","unstructured":"Resende, M.G.C. and C.C. Ribeiro. (2003a). \u201cGreedy Randomized Adaptive Search Procedures.\u201d In F. Glover and G. Kochenberger (eds.), Handbook of Metaheuristics, Kluwer, 219\u2013249.","DOI":"10.1007\/0-306-48056-5_8"},{"key":"6662_CR28","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1002\/net.10065","volume":"41","author":"M.G.C. Resende","year":"2003b","unstructured":"Resende, M.G.C. and C.C. Ribeiro. (2003b). \u201cA GRASP With Path-relinking for Private Virtual Circuit Routing.\u201d Networks 41, 104\u2013114.","journal-title":"Networks"},{"key":"6662_CR29","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/B:HEUR.0000019986.96257.50","volume":"10","author":"M.G.C. Resende","year":"2004","unstructured":"Resende, M.G.C. and R.F. Werneck. (2004). \u201cA Hybrid Heuristic for the p-median Problem.\u201d Journal of Heuristics 10, 59\u201388.","journal-title":"Journal of Heuristics"},{"key":"6662_CR30","unstructured":"Resende, M.G.C. and C.C. Ribeiro. (2005). \u201cGRASP With Path-relinking: Recent Advances and Applications.\u201d In T. Ibaraki, K. Nonobe and M. Yagiura (ed.), Metaheuristics: Progress as Real Problem Solvers, Kluwer."},{"key":"6662_CR31","doi-asserted-by":"crossref","unstructured":"Ribeiro, C.C. and I. Rosseti. (2002). \u201cA Parallel GRASP for the 2-path Network Design Problem.\u201d Lecture Notes in Computer Science, 2004, 922\u2013926.","DOI":"10.1007\/3-540-45706-2_131"},{"key":"6662_CR32","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0305-0548(93)E0021-K","volume":"22","author":"P.A. Rubin","year":"1995","unstructured":"Rubin, P.A. and G.L. Ragatz. (1995). \u201cScheduling in a Sequence Dependent Setup Environment With Genetic Search.\u201d Computers and Operations Research 22, 85\u201399.","journal-title":"Computers and Operations Research"},{"key":"6662_CR33","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. and R. Narasimhan. (1997). \u201cMinimizing Tardiness on a Single Processor with Sequence-Dependent Setup Times: A Simulated Annealing Approach.\u201d OMEGA 25, 619\u2013634.","journal-title":"OMEGA"},{"key":"6662_CR34","doi-asserted-by":"crossref","unstructured":"Tan, K.C., R. Narasimhan, P.A. Rubin, and G.L. Ragatz. (2000). \u201cA Comparison of Four Methods for Minimizing Total Tardiness on a Single Processor with Sequence Dependent Setup Times.\u201d OMEGA 28, 313\u2013326.","DOI":"10.1016\/S0305-0483(99)00050-X"},{"key":"6662_CR35","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1287\/mnsc.33.8.1035","volume":"33","author":"A. Vepsalainen","year":"1987","unstructured":"Vepsalainen, A. and T.E. Morton. (1987). \u201cPriority Rules for Jobshops With Weighted Tardiness Costs.\u201d Management Science 33, 1035\u20131047.","journal-title":"Management Science"},{"key":"6662_CR36","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.ejor.2004.08.019","volume":"169","author":"D.S. Yamashita","year":"2006","unstructured":"Yamashita, D.S., V.A. Armentano, and M. Laguna. (2006). \u201cScatter Search for Project Scheduling with Resource Availability Cost.\u201d European Journal of Operational Research 169, 623\u2013637.","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-006-6662-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-006-6662-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-006-6662-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:27Z","timestamp":1559256867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-006-6662-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":36,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2006,12]]}},"alternative-id":["6662"],"URL":"https:\/\/doi.org\/10.1007\/s10732-006-6662-x","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}