{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:14:06Z","timestamp":1759133646519},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":[[1996]]},"DOI":"10.1007\/bf00127078","type":"journal-article","created":{"date-parts":[[2004,11,4]],"date-time":"2004-11-04T03:36:22Z","timestamp":1099539382000},"page":"207-223","source":"Crossref","is-referenced-by-count":33,"title":["Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints"],"prefix":"10.1007","volume":"1","author":[{"given":"Stella C. S.","family":"Porto","sequence":"first","affiliation":[]},{"given":"Celso C.","family":"Ribeiro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","series-title":"Technical Report HAR-91-06","volume-title":"Massively Parallel Tabu Search for the Quadratic Assignment Problem","author":"J. Chakrapani","year":"1992","unstructured":"Chakrapani, J., and J., Skorin-Kapov. (1992). ?Massively Parallel Tabu Search for the Quadratic Assignment Problem.? Technical Report HAR-91?06. Harriman School, Stony Brook."},{"key":"CR2","unstructured":"Chakrapani, J., and J. Skorin-Kapov. (1993). ?Mapping Tasks to Processors to Minimize Communication Time in a Multiprocessor System.? Working paper."},{"key":"CR3","unstructured":"Crainic, T.G., M. Toulouse, and M. Gendreau. (1993a). ?An Appraisal of Asynchronous Parallelization Approaches for Tabu Search Algorithm.? Research Report CRT-935, Centre de Recherche sur les Transports, Universit e de Montr\u00e9al."},{"key":"CR4","unstructured":"Crainic, T.G., M. Toulouse, and M. Gendreau. (1993b). ?A Study of Synchronous Parallelization Strategies for Tabu Seach.? Research Report CRT-934, Centre de Recherche sur les Transports, Universit\u00e9 de Montr\u00e9al."},{"key":"CR5","unstructured":"Crainic, T.G., M. Toulouse, and M. Gendreau. (1993c). ?Towards a Taxonomy of Parallel Tabu Search Algorithms.? Research Report CRT-933, Centre de Recherche sur les Transports, Universit\u00e9 de Montr\u00e9al."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0166-218X(92)00033-I","volume":"51","author":"C.-N. Fiechter","year":"1994","unstructured":"Fiechter, C.-N. (1994). ?A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems.? Discrete Applied Mathematics 51, 243?267.","journal-title":"Discrete Applied Mathematics"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1016\/0305-0548(94)90073-6","volume":"21","author":"B. Garcia","year":"1994","unstructured":"Garcia, B., and M., Toulouse. (1994). ?A Parallel Tabu Search for the Vehicle Routing Problem with Time Windows.? Computers and Operational Research 21, 1025?1033.","journal-title":"Computers and Operational Research"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F. (1989). ?Tabu Search: Part I.? ORSA Journal on Computing 1, 190?206.","journal-title":"ORSA Journal on Computing"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F. (1990). ?Tabu Search: Part II.? ORSA Journal on Computing 2, 4?32.","journal-title":"ORSA Journal on Computing"},{"key":"CR10","first-page":"70","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"F. Glover","year":"1992","unstructured":"Glover, F., and Manuel, Laguna. (1992). ?Tabu Search.? In C.R., Reeves (ed.), Modern Heuristic Techniques for Combinatorial Problems (pp. 70?150). Oxford: Blackwell Scientific."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02078647","volume":"41","author":"F. Glover","year":"1993","unstructured":"Glover, F., E., Taillard, and D.De, Werra. (1993). ?A User's Guide to Tabu Search.? Annals of Operations Research 41, 3?28.","journal-title":"Annals of Operations Research"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Menasc\u00e9, D.A., and V. Almeida. (1990). ?Cost-Performance Analysis of Heterogeneity in Supercomputer Architectures.? Proceedings of the Supercomputing '90 Conference. New York.","DOI":"10.1109\/SUPERC.1990.130017"},{"key":"CR13","series-title":"Proceedings of the IEEE International Parallel Processing Symposium","first-page":"186","volume-title":"Processor Assignment in Heterogeneous Parallel Architectures","author":"D.A. Menasc\u00e9","year":"1992","unstructured":"Menasc\u00e9, D.A., and S.C.S., Porto. (1992). ?Processor Assignment in Heterogeneous Parallel Architectures.? Proceedings of the IEEE International Parallel Processing Symposium (pp. 186?191). Beverly Hills: IEEE."},{"key":"CR14","unstructured":"Porto, S.C.S. (1991). ?Algoritmos Heur\u00edsticos para o Escalonamento de Tarefas em Multiprocessadores com Arquitetura Heterog\u00eanea: Constru\u00e7\u00e3o Sistem\u00e1tica e Avalia\u00e7\u00e3o de Desempenho.? M.Sc. dissertation, Catholic University of Rio de Janeiro, Department of Computer Science, Rio de Janeiro."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1142\/S012905339500004X","volume":"7","author":"S.C.S. Porto","year":"1995","unstructured":"Porto, S.C.S., and C.C., Ribeiro. (1995). ?A Tabu Search Approach to Task Scheduling on Heterogeneous Processors Under Precedence Constraints.? International Journal of High Speed Computing 7, 45?71.","journal-title":"International Journal of High Speed Computing"},{"key":"CR16","volume-title":"Designing Efficient Algorithms for Parallel Processors","author":"M.J. Quinn","year":"1987","unstructured":"Quinn, M.J. (1987). Designing Efficient Algorithms for Parallel Processors. New York: McGraw-Hill."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/322186.322195","volume":"27","author":"M. Reiser","year":"1980","unstructured":"Reiser, M., and S.S., Lavenberg. (1980). ?Mean Value Analysis of Closed Multichain Queueing Networks.? Journal of the Association for Computing Machinery 27, 313?322.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"7","author":"E. Taillard","year":"1991","unstructured":"Taillard, E. (1991). ?Robust Tabu Search for the Quadratic Assignment Problem.? Parallel Computing 7, 443?455.","journal-title":"Parallel Computing"},{"key":"CR19","unstructured":"Zahorjan, J. (1992). Personal communication."},{"key":"CR20","unstructured":"Zahorjan, J., and C. McCann. (1989). ?Processor Scheduling in Shared Memory Multiprocessors.? Technical Report 89-09-17, Department of Computer Science and Engineering, University of Washington."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00127078.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00127078\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00127078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T04:48:53Z","timestamp":1554266933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00127078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996]]}},"alternative-id":["BF00127078"],"URL":"https:\/\/doi.org\/10.1007\/bf00127078","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}