{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:04:02Z","timestamp":1725516242573},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540693833"},{"type":"electronic","value":"9783540693840"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69384-0_32","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T02:39:15Z","timestamp":1217471955000},"page":"264-273","source":"Crossref","is-referenced-by-count":3,"title":["Parallel Path-Relinking Method for the Flow Shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Bo\u017cejko","sequence":"first","affiliation":[]},{"given":"Mieczys\u0142aw","family":"Wodecki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","volume-title":"Parallel Metaheuristics","author":"E. Alab","year":"2005","unstructured":"Alab, E.: Parallel Metaheuristics. Wiley & Sons Inc., Chichester (2005)"},{"key":"32_CR2","first-page":"189","volume-title":"Proceedings of PARELEC 2004","author":"W. Bo\u017cejko","year":"2004","unstructured":"Bo\u017cejko, W., Wodecki, M.: Solving the flow shop problem by parallel tabu search. In: Proceedings of PARELEC 2004, pp. 189\u2013194. IEEE Computer Society, Los Alamitos (2004)"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1007\/978-3-540-24669-5_74","volume-title":"Parallel Processing and Applied Mathematics","author":"W. Bo\u017cejko","year":"2004","unstructured":"Bo\u017cejko, W., Wodecki, M.: Parallel genetic algorithm for the flow shop scheduling problem. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Wa\u015bniewski, J. (eds.) PPAM 2004. LNCS, vol.\u00a03019, pp. 566\u2013571. Springer, Heidelberg (2004)"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Seti, R.: The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research\u00a01, 117\u2013129 (1976)","journal-title":"Mathematics of Operations Research"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Grabowski, J.: A new algorithm of solving the flow-shop problem, Operations Research in Progress, pp. 57\u201375. D. Reidel Publishing Company (1982)","DOI":"10.1007\/978-94-009-7901-7_6"},{"key":"32_CR6","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1057\/palgrave.jors.2601055","volume":"52","author":"J. Grabowski","year":"2000","unstructured":"Grabowski, J., Pempera, J.: New block properties for the permutation flow shop problem with application in tabu search. Journal of Operational Research Society\u00a052, 210\u2013220 (2000)","journal-title":"Journal of Operational Research Society"},{"issue":"4","key":"32_CR7","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/MIS.2005.74","volume":"20","author":"T. James","year":"2005","unstructured":"James, T., Rego, C., Glover, F.: Sequential and Parallel Path-Relinking Algorithms for the Quadratic Assignment Problem. IEEE Intelligent Systems\u00a020(4), 58\u201365 (2005)","journal-title":"IEEE Intelligent Systems"},{"key":"32_CR8","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":"32_CR9","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.ejor.2004.08.021","volume":"169","author":"E. Nowicki","year":"2006","unstructured":"Nowicki, E., Smutnicki, C.: Some aspects of scatter search in the flow-shop problem. European Journal of Operational Research\u00a0169, 654\u2013666 (2006)","journal-title":"European Journal of Operational Research"},{"key":"32_CR10","unstructured":"OR-Library: http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1162\/evco.1998.6.1.45","volume":"6","author":"C.R. Reeves","year":"1998","unstructured":"Reeves, C.R., Yamada, T.: Genetic algorithms, path relinking and the flowshop sequencing problem. Evolutionary Computation\u00a06, 45\u201360 (1998)","journal-title":"Evolutionary Computation"},{"issue":"1","key":"32_CR12","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/S0377-2217(97)00139-2","volume":"109","author":"C. Smutnicki","year":"1998","unstructured":"Smutnicki, C.: Some results of the worst-case analysis for flow shop scheduling. European Journal of Operational Research\u00a0109(1), 66\u201387 (1998)","journal-title":"European Journal of Operational Research"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research\u00a064, 278\u2013285 (1993)","journal-title":"European Journal of Operational Research"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Wang, C., Chu, C., Proth, J.: Heuristic approaches for n\/m\/F\/\u03a3C i scheduling problems. European Journal of Operational Research, 636\u2013644 (1997)","DOI":"10.1016\/0377-2217(95)00347-9"},{"key":"32_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-48086-2_26","volume-title":"Parallel Processing and Applied Mathematics","author":"M. Wodecki","year":"2002","unstructured":"Wodecki, M., Bo\u017cejko, W.: Solving the flow shop problem by parallel simulated annealing. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Wa\u015bniewski, J. (eds.) PPAM 2001. LNCS, vol.\u00a02328, pp. 236\u2013247. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69384-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T22:02:39Z","timestamp":1557698559000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69384-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540693833","9783540693840"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69384-0_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}