{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T23:14:10Z","timestamp":1648854850479},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2004,5,1]],"date-time":"2004-05-01T00:00:00Z","timestamp":1083369600000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,5]]},"DOI":"10.1016\/s0377-2217(02)00796-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:25:26Z","timestamp":1049721926000},"page":"626-640","source":"Crossref","is-referenced-by-count":2,"title":["Heuristic methods for gang-rip saw arbor design"],"prefix":"10.1016","volume":"154","author":[{"given":"Yahya","family":"Fathi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vural","family":"Aksakalli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00796-8_BIB1","unstructured":"V. Aksakalli, Heuristic methods for gang-rip saw arbor design and scheduling, Master\u2019s Thesis, Department of IE, NCSU, Raleigh, NC, 1999"},{"key":"10.1016\/S0377-2217(02)00796-8_BIB2","doi-asserted-by":"crossref","first-page":"1424","DOI":"10.1287\/mnsc.30.12.1424","article-title":"Application of mathematical programming to the plywood design and manufacturing problem","volume":"30","author":"Atkins","year":"1984","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00796-8_BIB3","series-title":"Cutting and Packing in Production and Distribution","author":"Dyckhoff","year":"1992"},{"key":"10.1016\/S0377-2217(02)00796-8_BIB4","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1287\/opre.33.2.459","article-title":"Forest outrun optimization by Dantzig\u2013Wolfe decomposition and dynamic programming column generation","volume":"33","author":"Eng","year":"1985","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00796-8_BIB5","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0377-2217(90)90360-N","article-title":"The cutting stock problem in canvas industry","volume":"44","author":"Farley","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00796-8_BIB6","unstructured":"Y. Fathi, S.C. Kegler, Gang-rip arbor design and scheduling (GRADS) software package, Furniture Manufacturing and Management Center, North Carolina State University, Raleigh, NC, 1994"},{"issue":"2","key":"10.1016\/S0377-2217(02)00796-8_BIB7","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1080\/00207549608904905","article-title":"A column generation procedure for gang-rip arbor design and scheduling","volume":"34","author":"Fathi","year":"1996","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(02)00796-8_BIB8","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0377-2217(90)90354-E","article-title":"A two-phase roll cutting problem","volume":"44","author":"Ferreira","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00796-8_BIB9","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(02)00796-8_BIB10","series-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1975"},{"issue":"6","key":"10.1016\/S0377-2217(02)00796-8_BIB11","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","article-title":"Optimization by simulated annealing: an experimental evaluation part I. graph partitioning","volume":"37","author":"Johnson","year":"1989","journal-title":"Journal of Operations Research"},{"key":"10.1016\/S0377-2217(02)00796-8_BIB12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1137\/0206004","article-title":"Polynomial complete consecutive information retrieval problems","volume":"6","author":"Kou","year":"1977","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S0377-2217(02)00796-8_BIB13","series-title":"Genetic Algorithms+Data Structures=Evolution Programs","author":"Michalewicz","year":"1992"},{"key":"10.1016\/S0377-2217(02)00796-8_BIB14","series-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"Collin","year":"1993"},{"key":"10.1016\/S0377-2217(02)00796-8_BIB15","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1016\/0305-0548(86)90077-8","article-title":"Near-optimal solutions to one-dimensional cutting stock problem","volume":"13","author":"Roodman","year":"1986","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(02)00796-8_BIB16","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0305-0548(86)90027-4","article-title":"A new cutting-stock heuristic for scheduling production","volume":"13","author":"Sumichrast","year":"1986","journal-title":"Computers and operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007968?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007968?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T02:56:59Z","timestamp":1553914619000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702007968"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["S0377221702007968"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00796-8","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}