{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T03:09:08Z","timestamp":1771038548660,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"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":[[2002,9]]},"DOI":"10.1016\/s0377-2217(02)00128-5","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T15:58:20Z","timestamp":1034092700000},"page":"328-340","source":"Crossref","is-referenced-by-count":22,"title":["A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry"],"prefix":"10.1016","volume":"141","author":[{"given":"Michael","family":"Armbruster","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00128-5_BIB1","unstructured":"M. Armbruster, Minimaler Verschnitt beim Zuschnitt von Staeben, Diploma Thesis, Technische Universitaet Chemnitz, Fakultaet fuer Mathematik, Chemnitz, 2000, Available from <http:\/\/www.tu-chemnitz.de\/\u223cmarmbru\/download.html>"},{"key":"10.1016\/S0377-2217(02)00128-5_BIB2","series-title":"Cutting and Packing in Production and Distribution \u2013 A Typology and Bibliography","author":"Dyckhoff","year":"1992"},{"key":"10.1016\/S0377-2217(02)00128-5_BIB3","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\/S0377-2217(02)00128-5_BIB4","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\/S0377-2217(02)00128-5_BIB5","series-title":"Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(02)00128-5_BIB6","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","article-title":"A linear programming approach to the cutting-stock problem","volume":"9","author":"Gilmore","year":"1961","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00128-5_BIB7","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1287\/opre.11.6.863","article-title":"A linear programming approach to the cutting-stock problem \u2013 Part II","volume":"11","author":"Gilmore","year":"1963","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00128-5_BIB8","series-title":"Knapsack Problems \u2013 Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"key":"10.1016\/S0377-2217(02)00128-5_BIB9","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 problems","volume":"13","author":"Roodman","year":"1986","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(02)00128-5_BIB10","series-title":"Zuschnittprobleme und ihre praktische Loesung","author":"Terno","year":"1987"},{"key":"10.1016\/S0377-2217(02)00128-5_BIB11","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01539705","article-title":"Heuristics for the one-dimensional cutting stock problem: A computational study","volume":"18","author":"Waescher","year":"1996","journal-title":"OR Spektrum"},{"key":"10.1016\/S0377-2217(02)00128-5_BIB12","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\/S0377-2217(02)00128-5_BIB13","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\/S0377-2217(02)00128-5_BIB14","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"},{"key":"10.1016\/S0377-2217(02)00128-5_BIB15","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"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702001285?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702001285?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T19:58:18Z","timestamp":1554753498000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702001285"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0377221702001285"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00128-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}