{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:30:26Z","timestamp":1759667426483},"reference-count":9,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1016\/s0305-0548(00)00027-7","type":"journal-article","created":{"date-parts":[[2002,12,10]],"date-time":"2002-12-10T21:10:39Z","timestamp":1039554639000},"page":"1075-1092","source":"Crossref","is-referenced-by-count":16,"title":["Scheduling using tabu search methods with intensification and diversification"],"prefix":"10.1016","volume":"28","author":[{"given":"Jacques A.","family":"Ferland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soumia","family":"Ichoua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Lavoie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Gagn\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(00)00027-7_BIB1","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/opre.44.2.347","article-title":"An object-oriented methodology for solving assignment type problems with neighborhood search techniques","volume":"44","author":"Ferland","year":"1996","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00027-7_BIB2","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1016\/0305-0548(94)90018-3","article-title":"A study of diversification strategies for the quadratic assignment problem","volume":"21","author":"Kelly","year":"1994","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(00)00027-7_BIB3","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1090\/dimacs\/026\/29","article-title":"Object-oriented implementation of heuristic search methods for graph coloring, maximum clique and satisfiability","volume":"26","author":"Fleurent","year":"1996","journal-title":"DIMACS Series in Mathematics and Theoretical Computer Science"},{"key":"10.1016\/S0305-0548(00)00027-7_BIB4","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","article-title":"Robust tabu search for the quadratic assignment problem","volume":"17","author":"Taillard","year":"1991","journal-title":"Parallel Computing"},{"key":"10.1016\/S0305-0548(00)00027-7_BIB5","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF02023074","article-title":"Preventive maintenance scheduling of power generating units","volume":"41","author":"Charest","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(00)00027-7_BIB6","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1016\/0305-0548(94)90017-5","article-title":"Applying tabu search with influential diversification to multiprocessor scheduling","volume":"21","author":"Hubscher","year":"1984","journal-title":"Computers Operations Research"},{"key":"10.1016\/S0305-0548(00)00027-7_BIB7","unstructured":"Ichoua S. Probl\u00e8mes d'affectation avec contraintes d'alternatives et application \u00e0 la gestion des stages de r\u00e9sidence. Master thesis, D\u00e9partement d'Informatique et de Recherche Op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al, Canada, 1995."},{"key":"10.1016\/S0305-0548(00)00027-7_NEWBIB8","doi-asserted-by":"crossref","unstructured":"Glover F. Tabu Search, Part 1. ORSA Journal of Computing 1989; 1 : 190\u2013206.","DOI":"10.1287\/ijoc.1.3.190"},{"key":"10.1016\/S0305-0548(00)00027-7_NEWBIB9","unstructured":"Glover F, Laguna M. in: Reeves C, editor, Tabu Search. Modern heuristic techniques for combinatorial problems. Oxford: Blackwell Scientific Publishing, 1993, p. 70\u2013150."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000277?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000277?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T00:22:04Z","timestamp":1556238124000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000277"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":9,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0305054800000277"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00027-7","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}