{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T07:46:22Z","timestamp":1759131982030},"reference-count":29,"publisher":"Elsevier BV","issue":"5-6","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":["Future Generation Computer Systems"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1016\/s0167-739x(98)00044-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:24:10Z","timestamp":1027599850000},"page":"425-438","source":"Crossref","is-referenced-by-count":5,"title":["A fault-tolerant parallel heuristic for assignment problems"],"prefix":"10.1016","volume":"14","author":[{"given":"E.-G.","family":"Talbi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Z.","family":"Hafidi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Kebbal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.-M.","family":"Geib","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-739X(98)00044-2_BIB1","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 Ser. Discrete Math. Theoret. Comput. Sci."},{"key":"10.1016\/S0167-739X(98)00044-2_BIB2","series-title":"Proceedings of the Second Symposium on High Performance Computing","first-page":"71","article-title":"A parallel genetic algorithm for process-processor mapping","author":"Muntean","year":"1991"},{"key":"10.1016\/S0167-739X(98)00044-2_BIB3","series-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"Reeves","year":"1993"},{"key":"10.1016\/S0167-739X(98)00044-2_BIB4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/37499.37502","article-title":"Using idle workstations in a shared computing environment","volume":"215","author":"Nichols","year":"1987","journal-title":"ACM Operating Sys. Rev."},{"issue":"11","key":"10.1016\/S0167-739X(98)00044-2_BIB5","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 Trans. Software Engrg."},{"issue":"13","key":"10.1016\/S0167-739X(98)00044-2_BIB6","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search \u2014 part I","author":"Glover","year":"1989","journal-title":"ORSA J. Comput"},{"issue":"4598","key":"10.1016\/S0167-739X(98)00044-2_BIB7","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/S0167-739X(98)00044-2_BIB8","series-title":"Modern Heuristic Techniques for Combinatorial Problems","first-page":"70","article-title":"Tabu search","author":"Glover","year":"1992"},{"issue":"2","key":"10.1016\/S0167-739X(98)00044-2_BIB9","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":"J. Heuristics"},{"key":"10.1016\/S0167-739X(98)00044-2_BIB10","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":"Ann. Oper. Res."},{"key":"10.1016\/S0167-739X(98)00044-2_BIB11","series-title":"Parallel Optimization Colloquium POC96","article-title":"Hybrid parallel heuristics for the quadratic assignment problem","author":"Bachelet","year":"1996"},{"key":"10.1016\/S0167-739X(98)00044-2_BIB12","article-title":"A parallel tabu search heuristic for the vehicle routing problem with time windows","author":"Badeau","year":"1995"},{"key":"10.1016\/S0167-739X(98)00044-2_BIB13","series-title":"Sixth ACM International Conference on Supercomputing","article-title":"Supercomputing out of recycled garbage: Preliminary experience with Piranha","author":"Gelernter","year":"1991"},{"key":"10.1016\/S0167-739X(98)00044-2_BIB14","series-title":"Proceedings of the Workshop on Job Scheduling for Parallel Processing IPPS'95","first-page":"259","article-title":"Parallel processing on dynamic resources with CARMI","volume":"vol. 949","author":"Pruyne","year":"1995"},{"key":"10.1016\/S0167-739X(98)00044-2_BIB15","series-title":"European School of Computer Science ESPPE'96: Parallel Programming Environments for High Performance Computing","first-page":"119","article-title":"MARS: Adaptive scheduling of parallel applications in a multi-user heterogeneous environment","author":"Hafidi","year":"1996"},{"key":"10.1016\/S0167-739X(98)00044-2_BIB16","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","article-title":"Distributed snapshots: Determining global states of distributed systems","volume":"3","author":"Chandy","year":"1985","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/S0167-739X(98)00044-2_BIB17","series-title":"Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications PDPTA'97","first-page":"1643","article-title":"A new approach for checkpointing parallel applications","author":"Kebbal","year":"1997"},{"key":"10.1016\/S0167-739X(98)00044-2_BIB18","first-page":"111","article-title":"The tabu search metaheuristic: How we use it?","author":"Hertz","year":"1989","journal-title":"Ann. Math. Artifi. Intell."},{"key":"10.1016\/S0167-739X(98)00044-2_BIB19","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-739X(98)00044-2_BIB20","author":"Garey","year":"1979"},{"key":"10.1016\/S0167-739X(98)00044-2_BIB21","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":"J. ACM"},{"key":"10.1016\/S0167-739X(98)00044-2_BIB22","series-title":"Proceedings of the 11th International Parallel Processing Symposium","first-page":"418","article-title":"Joining forces in solving large-scale quadratic assignment problems in parallel","author":"Brungger","year":"1997"},{"key":"10.1016\/S0167-739X(98)00044-2_BIB23","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 Sci."},{"key":"10.1016\/S0167-739X(98)00044-2_BIB24","article-title":"Tabu search: Applications and prospects","author":"Voss","year":"1992"},{"key":"10.1016\/S0167-739X(98)00044-2_BIB25","article-title":"Towards a taxonomy of parallel tabu search algorithms","author":"Crainic","year":"1993"},{"key":"10.1016\/S0167-739X(98)00044-2_BIB26","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-739X(98)00044-2_BIB27","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 Comput."},{"key":"10.1016\/S0167-739X(98)00044-2_BIB28","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02022093","article-title":"Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem","volume":"21","author":"Malek","year":"1989","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0167-739X(98)00044-2_BIB29","series-title":"Proceedings of the Metaheuristics International Conference","first-page":"253","article-title":"A parallel tabu search algorithm using ejection chains for the vehicle routing problem","author":"Rego","year":"1995"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X98000442?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X98000442?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T18:20:02Z","timestamp":1556648402000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X98000442"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":29,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0167739X98000442"],"URL":"https:\/\/doi.org\/10.1016\/s0167-739x(98)00044-2","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}