{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T15:49:40Z","timestamp":1758815380586},"reference-count":30,"publisher":"Elsevier BV","issue":"14","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1016\/s0167-8191(98)00086-6","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T18:52:00Z","timestamp":1049741520000},"page":"2003-2019","source":"Crossref","is-referenced-by-count":28,"title":["A parallel adaptive tabu search approach"],"prefix":"10.1016","volume":"24","author":[{"given":"E.G.","family":"Talbi","sequence":"first","affiliation":[]},{"given":"Z.","family":"Hafidi","sequence":"additional","affiliation":[]},{"given":"J-M.","family":"Geib","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0167-8191(98)00086-6_BIB1","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search \u2013 Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB2","unstructured":"F. Glover, M. Laguna, Tabu search, in: C.R. Reeves (Ed.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, Oxford, 1992, pp. 70\u2013150"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB3","doi-asserted-by":"crossref","unstructured":"N. Boden, D. Cohen, R. Felderman, A. Kulawik, C. Seitz, J. Seizovic, W. Su, Myrinet \u2013 A gigabit-per-second local-area network, IEEE Micro (1995) 29\u201336","DOI":"10.1109\/40.342015"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB4","unstructured":"P.R. Woodward, Perspectives on supercomputing: Three decades of change, IEEE Computer (1996) 99\u2013111"},{"issue":"5","key":"10.1016\/S0167-8191(98)00086-6_BIB5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/37499.37502","article-title":"Using idle workstations in a shared computing environment","volume":"21","author":"Nichols","year":"1987","journal-title":"ACM Operating System Review"},{"issue":"11","key":"10.1016\/S0167-8191(98)00086-6_BIB6","doi-asserted-by":"crossref","first-page":"1444","DOI":"10.1109\/32.41336","article-title":"Finding idle machines in a workstation-based distributed system","volume":"15","author":"Theimer","year":"1989","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02078647","article-title":"A user's guide to tabu search","volume":"41","author":"Glover","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB8","unstructured":"A. Hertz, D. de Werra, The tabu search metaheuristic: How we use it? Annals of Mathematics and Artificial Intelligence (1989) 111\u2013121"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB9","doi-asserted-by":"crossref","unstructured":"S. Voss, Tabu search: Applications and prospects, Technical report Technische Hochshule Darmstadt, Germany, 1992","DOI":"10.1142\/9789812798190_0017"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB10","unstructured":"T.D. Crainic, M. Toulouse, M. Gendreau, Towards a taxonomy of parallel tabu search algorithms, Technical Report CRT-933, Centre de Recherche sur les Transports, Universit\u00e9 de Montreal, 1993"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB11","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","article-title":"Parallel iterative search methods for vehicle routing problem","volume":"23","author":"Taillard","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB12","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","article-title":"Robust taboo search for the quadratic assignment problem","volume":"17","author":"Taillard","year":"1991","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB13","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF02022999","article-title":"Massively parallel tabu search for the quadratic assignment problem","volume":"41","author":"Chakrapani","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB14","doi-asserted-by":"crossref","unstructured":"M. Malek, M. Guruswamy, M. Pandya, H. Owens, Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem, Annals of Operations Research 21 (1989) 59\u201384","DOI":"10.1007\/BF02022093"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB15","doi-asserted-by":"crossref","unstructured":"C. Rego, C. Roucairol, A parallel tabu search algorithm using ejection chains for the vehicle routing problem, in: Proc. of the Metaheuristics Int. Conf., Breckenridge, 1995, pp. 253\u2013295","DOI":"10.1007\/978-1-4613-1361-8_40"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB16","unstructured":"P. Badeau, M. Gendreau, F. Guertin, J.-Y. Potvin, E. Taillard, A parallel tabu search heuristic for the vehicle routing problem with time windows, RR CRT-95-84, Centre de Recherche sur les Transports, Universit\u00e9 de Montr\u00e9al, 1995"},{"issue":"2","key":"10.1016\/S0167-8191(98)00086-6_BIB17","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF00127078","article-title":"Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints","volume":"1","author":"Porto","year":"1996","journal-title":"Journal of heuristics"},{"issue":"2","key":"10.1016\/S0167-8191(98)00086-6_BIB18","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/32.4634","article-title":"A taxonomy of scheduling in general-purpose distributed computing systems","volume":"14","author":"Casavant","year":"1988","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB19","unstructured":"D.L. Kaminsky, Adaptive parallelism in Piranha, Ph.D. thesis, Department of Computer Science, Yale University, RR-1021, 1994"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB20","doi-asserted-by":"crossref","unstructured":"J. Pruyne, M. Livny, Parallel processing on dynamic resources with CARMI, in: Proc. of the Workshop on Job Scheduling for Parallel Processing IPPS'95, Lecture Notes On Computer Science, No.949, Springer, Berlin, 1995, pp. 259\u2013278","DOI":"10.1007\/3-540-60153-8_33"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB21","unstructured":"Z. Hafidi, E.G. Talbi, J.-M. Geib, MARS: Adaptive scheduling of parallel applications in a multi-user heterogeneous environment, in: European School of Computer Science ESPPE'96: Parallel Programming Environments for High Performance Computing, Alpe d'Huez, France, 1996, pp. 119\u2013122"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB22","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","article-title":"Assignment problems and the location of economic activities","volume":"25","author":"Koopmans","year":"1957","journal-title":"Econometrica"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB23","unstructured":"M. Garey, D. Johnson, Computers and Intractability: A guide to the theory on NP-completeness, Freeman, New York, 1979"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB24","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1145\/321958.321975","article-title":"P-complete approximation problems","volume":"23","author":"Sahni","year":"1976","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB25","doi-asserted-by":"crossref","unstructured":"A. Brungger, A. Marzetta, J. Clausen, M. Perregaard, Joining forces in solving large-scale quadratic assignment problems in parallel, in: A. Gottlieb (Ed.), 11th Int. Parallel Processing Symposium, Geneva, Switzerland, Morgan Kaufmann, Los Altos, CA, 1997, pp. 418\u2013427","DOI":"10.1109\/IPPS.1997.580936"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/dimacs\/016\/01","article-title":"The quadratic assignment problem: A survey and recent developments","volume":"16","author":"Pardalos","year":"1994","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB27","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0966-8349(95)00008-6","article-title":"Comparison of iterative searches for the quadratic assignment problem","volume":"3","author":"Taillard","year":"1995","journal-title":"Location Science"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB28","unstructured":"M.M. Eshagian, Heterogeneous computing, Artech House, MA, 1996"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB29","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1090\/dimacs\/016\/08","article-title":"Genetic hybrids for the quadratic assignment problem","volume":"16","author":"Fleurent","year":"1994","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"10.1016\/S0167-8191(98)00086-6_BIB30","unstructured":"D. Kebbal, E.G. Talbi, J.-M. Geib, A new approach for check pointing parallel applications, in: Int. Conf. on Parallel and Distributed Processing Techniques and Applications PDPTA'97, LasVegas, USA, 1997, pp. 1643\u20131651"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819198000866?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819198000866?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T15:32:04Z","timestamp":1578497524000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819198000866"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":30,"journal-issue":{"issue":"14","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0167819198000866"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(98)00086-6","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}