{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T00:39:09Z","timestamp":1728175149588},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T00:00:00Z","timestamp":1283299200000},"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 & Industrial Engineering"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1016\/j.cie.2010.05.004","type":"journal-article","created":{"date-parts":[[2010,5,11]],"date-time":"2010-05-11T07:22:21Z","timestamp":1273562541000},"page":"323-333","source":"Crossref","is-referenced-by-count":70,"title":["Parallel hybrid metaheuristics for the flexible job shop problem"],"prefix":"10.1016","volume":"59","author":[{"given":"Wojciech","family":"Bo\u017cejko","sequence":"first","affiliation":[]},{"given":"Mariusz","family":"Uchro\u0144ski","sequence":"additional","affiliation":[]},{"given":"Mieczys\u0142aw","family":"Wodecki","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cie.2010.05.004_bib1","series-title":"Parallel metaheuristics. A new class of algorithms","author":"Alba","year":"2005"},{"key":"10.1016\/j.cie.2010.05.004_bib2","unstructured":"Barnes, J. W., Chambers, J. B. (1996). Flexible job shop scheduling by tabu search. Graduate program in operations research and industrial engineering, The University of Texas at Austin, Technical Report Series: ORP96-09."},{"key":"10.1016\/j.cie.2010.05.004_bib3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/j.cie.2008.11.022","article-title":"Solving permutational routing problems by population-based metaheuristics","volume":"57","author":"Bo\u017cejko","year":"2009","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.cie.2010.05.004_bib4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","article-title":"Routing and scheduling in a flexible job shop by tabu search","volume":"41","author":"Brandimarte","year":"1993","journal-title":"Annals of Operations Research"},{"issue":"3","key":"10.1016\/j.cie.2010.05.004_bib5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1018930406487","article-title":"An integrated approach for modeling and solving the general multiprocessor job shop scheduling problem using tabu search","volume":"70","author":"Dauz\u00e8re-P\u00e9r\u00e8s","year":"1997","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.cie.2010.05.004_bib6","doi-asserted-by":"crossref","unstructured":"Defersha, F. M., Chen, M. (2009). A coarse-grain parallel genetic algorithm for flexible job-shop scheduling with lot streaming. In Proceedings of the international conference on computational science and engineering (Vol. 1, pp. 201\u2013208).","DOI":"10.1109\/CSE.2009.401"},{"key":"10.1016\/j.cie.2010.05.004_bib7","doi-asserted-by":"crossref","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","article-title":"A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems","volume":"35","author":"Gao","year":"2008","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2010.05.004_bib8","unstructured":"Grabowski, J. (1979). Generalized problems of operations sequencing in the discrete production systems (in Polish). Monographs, 9, Scientific Papers of the Institute of Technical Cybernetics of Wroc\u0142aw Technical Univercity."},{"key":"10.1016\/j.cie.2010.05.004_bib9","series-title":"Adaptive memory and evolution; tabu search and scatter search","first-page":"117","article-title":"A very fast tabu search algorithm for the job shop problem","author":"Grabowski","year":"2005"},{"key":"10.1016\/j.cie.2010.05.004_bib10","doi-asserted-by":"crossref","unstructured":"Ho, N. B., Tay, J. C. (2004). GENACE: An efficient cultural algorithm for solving the flexible job-shop problem. In IEEE international conference on robotics and automation (pp. 1759\u20131766).","DOI":"10.1109\/CEC.2004.1331108"},{"key":"10.1016\/j.cie.2010.05.004_bib11","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01719451","article-title":"Tabu search for the job shop scheduling problem with multi-purpose machine","volume":"15","author":"Hurink","year":"1994","journal-title":"Operations Research Spektrum"},{"key":"10.1016\/j.cie.2010.05.004_bib12","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1023\/A:1024653810491","article-title":"A modified genetic algorithm for distributed scheduling problems","volume":"14","author":"Jia","year":"2003","journal-title":"International Journal of Intelligent Manufacturing"},{"issue":"1","key":"10.1016\/j.cie.2010.05.004_bib13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TSMCC.2002.1009117","article-title":"Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems","volume":"32","author":"Kacem","year":"2002","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part C"},{"issue":"1","key":"10.1016\/j.cie.2010.05.004_bib14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y","article-title":"Effective neighborhood functions for the flexible job shop problem","volume":"3","author":"Mastrolilli","year":"2000","journal-title":"Journal of Scheduling"},{"key":"10.1016\/j.cie.2010.05.004_bib15","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","article-title":"A fast tabu search algorithm for the permutation flow-shop problem","volume":"91","author":"Nowicki","year":"1996","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.cie.2010.05.004_bib16","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/0377-2217(95)00059-Y","article-title":"A hierarchical approach for the FMS schduling problem","volume":"86","author":"Pauli","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2010.05.004_bib17","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","article-title":"A genetic algorithm for the flexible job-shop scheduling problem","volume":"35","author":"Pezzella","year":"2008","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2010.05.004_bib18","series-title":"Scheduling: Theory, algorithms and systems","author":"Pinedo","year":"2002"},{"issue":"5","key":"10.1016\/j.cie.2010.05.004_bib19","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1023\/A:1016540724870","article-title":"A taxonomy of hybrid metaheuristics","volume":"8","author":"Talbi","year":"2002","journal-title":"Journal of Heuristics"},{"issue":"1","key":"10.1016\/j.cie.2010.05.004_bib20","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1016\/j.eswa.2009.06.007","article-title":"Flexible job-shop scheduling with parallel variable neighborhood search algorithm","volume":"37","author":"Yazdani","year":"2010","journal-title":"Expert Systems with Applications: An International Journal"}],"container-title":["Computers & Industrial Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835210001191?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835210001191?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:19:53Z","timestamp":1559085593000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835210001191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["S0360835210001191"],"URL":"https:\/\/doi.org\/10.1016\/j.cie.2010.05.004","relation":{},"ISSN":["0360-8352"],"issn-type":[{"value":"0360-8352","type":"print"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}