{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T23:05:35Z","timestamp":1768518335480,"version":"3.49.0"},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":[[2000,1]]},"DOI":"10.1016\/s0167-8191(99)00096-4","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T04:06:40Z","timestamp":1051243600000},"page":"73-90","source":"Crossref","is-referenced-by-count":23,"title":["Performance evaluation of a parallel tabu search task scheduling algorithm"],"prefix":"10.1016","volume":"26","author":[{"given":"Stella C.S.","family":"Porto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jo\u00e3o Paulo F.W.","family":"Kitajima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Celso C.","family":"Ribeiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(99)00096-4_BIB1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02430363","article-title":"Designing and reporting on computational experiments with heuristic methods","volume":"1","author":"Barr","year":"1995","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0167-8191(99)00096-4_BIB2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01719254","article-title":"Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements","volume":"17","author":"Crainic","year":"1995","journal-title":"OR Spektrum"},{"key":"10.1016\/S0167-8191(99)00096-4_BIB3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/ijoc.9.1.61","article-title":"Towards a taxonomy of parallel tabu search algorithms","volume":"9","author":"Crainic","year":"1997","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0167-8191(99)00096-4_BIB4","unstructured":"T.G. Crainic and M. Toulouse, Parallel metaheuristics, Research report, Centre de Recherche sur les Transports, Universit\u00e8 de Montr\u00e9al, 1997"},{"key":"10.1016\/S0167-8191(99)00096-4_BIB5","unstructured":"H. El-Rewini, Partitioning and scheduling, in: A.Y.H. Zomaya (Ed.), Parallel and Distributed Handbook, McGraw-Hill, New York, 1996, pp. 239\u2013273 (Chapter 9)"},{"key":"10.1016\/S0167-8191(99)00096-4_BIB6","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0166-218X(92)00033-I","article-title":"A parallel tabu search algorithm for large traveling salesman problems","volume":"51","author":"Fiechter","year":"1994","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0167-8191(99)00096-4_BIB7","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1016\/0305-0548(94)90073-6","article-title":"A parallel tabu search for the vehicle routing problem with time windows","volume":"21","author":"Garcia","year":"1994","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0167-8191(99)00096-4_BIB8","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/322077.322090","article-title":"Strong NP-completeness results: motivation, examples and implications","volume":"25","author":"Garey","year":"1978","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0167-8191(99)00096-4_BIB9","series-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0167-8191(99)00096-4_BIB10","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 on Computing"},{"key":"10.1016\/S0167-8191(99)00096-4_BIB11","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search \u2013 Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0167-8191(99)00096-4_BIB12","unstructured":"F. Glover and M. Laguna, Tabu Search, in: C.R. Reeves (Ed.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, Oxford, 1992, pp. 70\u2013150 (Chapter 3)"},{"key":"10.1016\/S0167-8191(99)00096-4_BIB13","series-title":"Tabu Search","author":"Glover","year":"1997"},{"key":"10.1016\/S0167-8191(99)00096-4_BIB14","unstructured":"J.P. Kitajima, B. Plateau, P. Bouvry, D. Trystram, A method and a tool for performance evaluation. A case study: Evaluating mapping strategies, in: Proceedings of the 1994 Cray Users Group Meeting, Tours, 1994"},{"key":"10.1016\/S0167-8191(99)00096-4_BIB15","doi-asserted-by":"crossref","unstructured":"D.A. Menasc\u00e9, V. Almeida, Cost-performance analysis of heterogeneity in supercomputer architectures, in: Proceedings of the Supercomputing'90 Conference, New York, 1990","DOI":"10.1109\/SUPERC.1990.130017"},{"key":"10.1016\/S0167-8191(99)00096-4_BIB16","doi-asserted-by":"crossref","unstructured":"D.A. Menasc\u00e9, S.C.S. Porto, Processor assignment in heterogeneous parallel architectures, in: Proceedings of the IEEE International Parallel Processing Symposium, Beverly Hills, 1992, pp. 186\u2013191","DOI":"10.1109\/IPPS.1992.223049"},{"key":"10.1016\/S0167-8191(99)00096-4_BIB17","doi-asserted-by":"crossref","unstructured":"S.C.S. Porto, D.A. Menasc\u00e9, Processor assignment in heterogeneous message passing parallel architectures, in: Proceedings of the Hawaii International Conference on System Science, Kauai, 1993","DOI":"10.1109\/HICSS.1993.284076"},{"key":"10.1016\/S0167-8191(99)00096-4_BIB18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1142\/S012905339500004X","article-title":"A tabu search approach to task scheduling on heterogeneous processors under precedence constraints","volume":"7","author":"Porto","year":"1995","journal-title":"International Journal of High-Speed Computing"},{"key":"10.1016\/S0167-8191(99)00096-4_BIB19","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"},{"key":"10.1016\/S0167-8191(99)00096-4_BIB20","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/322186.322195","article-title":"Mean value analysis of closed multichain queueing networks","volume":"27","author":"Reiser","year":"1980","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0167-8191(99)00096-4_BIB21","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1287\/ijoc.6.2.108","article-title":"Parallel taboo search techniques for the job shop scheduling problem","volume":"6","author":"Taillard","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0167-8191(99)00096-4_BIB22","doi-asserted-by":"crossref","unstructured":"M. Toulouse, T.G. Crainic, M. Gendreau, Communication issues in designing cooperative multi-thread parallel searches, in: I.H. Osman, J.P. Kelly (Eds.), Meta-Heuristics: Theory and Applications, Kluwer Academic Publishers, Dordrecht, 1996, pp. 500\u2013522","DOI":"10.1007\/978-1-4613-1361-8_30"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819199000964?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819199000964?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T16:52:46Z","timestamp":1556470366000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819199000964"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S0167819199000964"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(99)00096-4","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}