{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T05:45:10Z","timestamp":1761630310533},"reference-count":19,"publisher":"Elsevier BV","issue":"14","license":[{"start":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T00:00:00Z","timestamp":1101859200000},"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 & Operations Research"],"published-print":{"date-parts":[[2004,12]]},"DOI":"10.1016\/s0305-0548(03)00189-8","type":"journal-article","created":{"date-parts":[[2003,7,16]],"date-time":"2003-07-16T13:35:31Z","timestamp":1058362531000},"page":"2315-2332","source":"Crossref","is-referenced-by-count":36,"title":["A method for solving the minimization of the maximum number of open stacks problem within a cutting process"],"prefix":"10.1016","volume":"31","author":[{"given":"Jos\u00e9 Carlos","family":"Becceneri","sequence":"first","affiliation":[]},{"given":"Horacio Hideki","family":"Yanasse","sequence":"additional","affiliation":[]},{"given":"Nei Yoshihiro","family":"Soma","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0305-0548(03)00189-8_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1590\/S0101-74382004000100001","article-title":"Minimization of open orders\u2014polynomial algorithms for some special cases","volume":"16","author":"Yanasse","year":"1996","journal-title":"Pesquisa Operacional"},{"key":"10.1016\/S0305-0548(03)00189-8_BIB2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1057\/jors.1974.5","article-title":"The cutting stock problem in the flat glass industry","volume":"25","author":"Dyson","year":"1974","journal-title":"Operations Research Quarterly"},{"key":"10.1016\/S0305-0548(03)00189-8_BIB3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF01588227","article-title":"Glass cutting in a small firm","volume":"17","author":"Madsen","year":"1979","journal-title":"Mathematical Programming"},{"issue":"3","key":"10.1016\/S0305-0548(03)00189-8_BIB4","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1057\/jors.1988.42","article-title":"An application of travelling-salesman routines to solve pattern-allocation problems in the glass industry","volume":"39","author":"Madsen","year":"1988","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0305-0548(03)00189-8_BIB5","first-page":"40","article-title":"Traversing trees and scheduling tasks for duplex corrugator machines","volume":"9","author":"Lins","year":"1989","journal-title":"Pesquisa Operacional"},{"issue":"1","key":"10.1016\/S0305-0548(03)00189-8_BIB6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0305-0548(98)80001-4","article-title":"Applications of modern heuristic search methods to pattern sequencing problems","volume":"26","author":"Fink","year":"1999","journal-title":"Computer and Operations Research"},{"key":"10.1016\/S0305-0548(03)00189-8_BIB7","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(97)00257-9","article-title":"Simulated annealing for order spread minimization in sequencing cutting patterns","volume":"110","author":"Foerster","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00189-8_BIB8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0377-2217(91)90222-H","article-title":"Heuristics for sequencing cutting patterns","volume":"55","author":"Yuen","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00189-8_BIB9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0377-2217(94)00068-N","article-title":"Improved heuristics for sequencing cutting patterns","volume":"87","author":"Yuen","year":"1995","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/S0305-0548(03)00189-8_BIB10","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/S0377-2217(97)00268-3","article-title":"Heuristic and exact methods for the cutting sequencing problem","volume":"110","author":"Faggioli","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00189-8_BIB11","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1016\/0377-2217(95)00025-L","article-title":"Establishing the optimality of sequencing heuristics for cutting stock problems","volume":"84","author":"Yuen","year":"1995","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/S0305-0548(03)00189-8_BIB12","first-page":"57","article-title":"A transformation for solving a pattern sequencing problem in the wood cut industry","volume":"17","author":"Yanasse","year":"1997","journal-title":"Pesquisa Operacional"},{"key":"10.1016\/S0305-0548(03)00189-8_BIB13","unstructured":"Limeira MS. Development of an exact algorithm for solving a cutting pattern sequencing problem. Master, Brazilian Space Research Institute, S\u00e3o Jos\u00e9 dos Campos, Brazil, 1998 [in portuguese]."},{"key":"10.1016\/S0305-0548(03)00189-8_BIB14","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1016\/S0377-2217(97)84107-0","article-title":"On a pattern sequencing problem to minimize the maximum number of open stacks","volume":"100","author":"Yanasse","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00189-8_BIB15","unstructured":"Becceneri JC. The pattern sequencing problem to minimize the maximum number of open stacks in industrial cutting environments. Dissertation, Aeronautic Institute of Technology, Brazil, 1999 [in portuguese]."},{"issue":"12","key":"10.1016\/S0305-0548(03)00189-8_BIB16","doi-asserted-by":"crossref","first-page":"1759","DOI":"10.1016\/S0305-0548(01)00054-5","article-title":"Connections between cutting-pattern sequencing, VLSI design, and flexible machines","volume":"29","author":"Linhares","year":"2002","journal-title":"Computers and Operations Research"},{"issue":"2","key":"10.1016\/S0305-0548(03)00189-8_BIB17","first-page":"249","article-title":"Bounds for a problem of sequencing patterns","volume":"19","author":"Yanasse","year":"1999","journal-title":"Pesquisa Operacional"},{"key":"10.1016\/S0305-0548(03)00189-8_BIB18","unstructured":"Yanasse HH, Pinto MJ. A cutting and sequencing integrated model. The Sixteenth Triennial Conference of the International Federation of Operational Research Societies, Edinburgh, Scotland, 2002. Programme, p. 121."},{"key":"10.1016\/S0305-0548(03)00189-8_BIB19","unstructured":"Pileggi GCF. Approaches for the optimization of the cutting patterns generation and sequencing integrated problems. Dissertation, University of S\u00e3o Paulo, Brazil, 2002 [in portuguese]."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001898?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001898?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T18:09:37Z","timestamp":1585073377000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803001898"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12]]},"references-count":19,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2004,12]]}},"alternative-id":["S0305054803001898"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00189-8","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,12]]}}}