{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T00:39:23Z","timestamp":1728175163215},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642132315"},{"type":"electronic","value":"9783642132322"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13232-2_48","type":"book-chapter","created":{"date-parts":[[2010,6,17]],"date-time":"2010-06-17T14:12:01Z","timestamp":1276783921000},"page":"395-402","source":"Crossref","is-referenced-by-count":5,"title":["Parallel Meta2heuristics for the Flexible Job Shop Problem"],"prefix":"10.1007","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":"297","reference":[{"key":"48_CR1","unstructured":"Barnes, J.W., Chambers, J.B.: Flexible job shop scheduling by tabu search. Graduate program in operations research snd industrial engineering, The University of Texas at Austin, Technical Report Series: ORP96-09 (1996)"},{"key":"48_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P. Brandimarte","year":"1993","unstructured":"Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research\u00a041, 157\u2013183 (1993)","journal-title":"Annals of Operations Research"},{"issue":"3","key":"48_CR3","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/A:1018930406487","volume":"70","author":"S. Dauz\u00e8re-P\u00e9r\u00e8s","year":"1997","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s, S., Pauli, J.: An integrated approach for modeling and solving the general multiprocessor job shop scheduling problem using tabu search. Annals of Operations Research\u00a070(3), 281\u2013306 (1997)","journal-title":"Annals of Operations Research"},{"key":"48_CR4","doi-asserted-by":"publisher","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","volume":"35","author":"J. Gao","year":"2008","unstructured":"Gao, J., Sun, L., Gen, M.: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers & Operations Research\u00a035, 2892\u20132907 (2008)","journal-title":"Computers & Operations Research"},{"key":"48_CR5","unstructured":"Grabowski, J.: Generalized problems of operations sequencing in the discrete production systems. In: Monographs, vol.\u00a09. Scientific Papers of the Institute of Technical Cybernetics of Wroc\u0142aw Technical Univercity (1979) (in Polish)"},{"issue":"1","key":"48_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y","volume":"3","author":"M. Mastrolilli","year":"2000","unstructured":"Mastrolilli, M., Gambardella, L.M.: Effective neighborhood functions for the flexible job shop problem. Journal of Scheduling\u00a03(1), 3\u201320 (2000)","journal-title":"Journal of Scheduling"},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","volume":"91","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutation flow-shop problem. European Journal of Operational Research\u00a091, 160\u2013175 (1996)","journal-title":"European Journal of Operational Research"},{"key":"48_CR8","doi-asserted-by":"publisher","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"F. Pezzella","year":"2008","unstructured":"Pezzella, F., Morganti, G., Ciaschetti, G.: A genetic algorithm for the Flexible Job-schop Scheduling Problem. Computers & Operations Research\u00a035, 3202\u20133212 (2008)","journal-title":"Computers & Operations Research"},{"key":"48_CR9","volume-title":"Scheduling: theory, algorithms and systems","author":"M. Pinedo","year":"2002","unstructured":"Pinedo, M.: Scheduling: theory, algorithms and systems. Prentice-Hall, Englewood Cliffs (2002)"}],"container-title":["Lecture Notes in Computer Science","Artifical Intelligence and Soft Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13232-2_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:58:37Z","timestamp":1619783917000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13232-2_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642132315","9783642132322"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13232-2_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}