{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:27:31Z","timestamp":1761596851858},"reference-count":15,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2004,3]]},"abstract":"<jats:p> A tabu search based approach is studied as a method for solving in parallel the two-dimensional irregular cutting problem. We use and compare different, variants of the method and various parallel computing systems. Systems used are based on message passing or shared memory paradigm. Parallel algorithms using both methods of communication are proposed. The efficiency of computer system utilization is discussed in the context of unpredictable time requirements of parallel tasks. We present results for different variants of the method together with efficiency measures for parallel implementations, where IBM SP2 and CRAY T3E systems, respectively, have been used. <\/jats:p>","DOI":"10.1142\/s0129626404001684","type":"journal-article","created":{"date-parts":[[2004,4,30]],"date-time":"2004-04-30T10:44:06Z","timestamp":1083321846000},"page":"23-32","source":"Crossref","is-referenced-by-count":15,"title":["Parallel tabu search approaches for two-dimensional cutting"],"prefix":"10.1142","volume":"14","author":[{"given":"Jacek","family":"B\u0142a\u017cewicz","sequence":"first","affiliation":[{"name":"Institute of Computing Science, Pozna\u0144 University of Technology, ul.Piotrowo 3a, 60-965 Pozna\u0144, Poland"},{"name":"Institute of Bioorganic Chemistry, Polish Academy of Sciences, ul. Noskowskiego 12, 60-704 Pozna\u0144, Poland"}]},{"given":"Adrian","family":"Moret-Salvador","sequence":"additional","affiliation":[{"name":"Institute of Computing Science, Pozna\u0144 University of Technology, ul.Piotrowo 3a, 60-965 Pozna\u0144, Poland"}]},{"given":"Rafa\u0142","family":"Walkowiak","sequence":"additional","affiliation":[{"name":"Institute of Computing Science, Pozna\u0144 University of Technology, ul.Piotrowo 3a, 60-965 Pozna\u0144, Poland"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","series-title":"LNCS","first-page":"322","volume":"294","author":"Avnaim F.","year":"1988"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1007\/BF02022998"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01719251"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1507-4_5"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.9.1.61"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90288-K"},{"key":"rf10","unstructured":"H.\u00a0Dyckoff, G.\u00a0Scheithauer and J.\u00a0Terno, Annotated Bibliographies in Combinatorial Optimization, Cutting and Packing, eds. M.\u00a0Dell'Amico, F.\u00a0Maffioli and S.\u00a0Martello (Wiley, 1997)\u00a0pp. 393\u2013414."},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1145\/322077.322090"},{"key":"rf12","first-page":"3","volume":"41","author":"Glover F.","journal-title":"Annals of Operations Research"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"rf14","volume":"17","author":"Graham R. L.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793248317"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1992.101"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(98)00086-6"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1007\/BF02430365"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626404001684","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:28:30Z","timestamp":1565184510000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626404001684"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":15,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2004,3]]}},"alternative-id":["10.1142\/S0129626404001684"],"URL":"https:\/\/doi.org\/10.1142\/s0129626404001684","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}