{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T11:59:57Z","timestamp":1762430397685},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,2,5]],"date-time":"2010-02-05T00:00:00Z","timestamp":1265328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s10951-010-0164-2","type":"journal-article","created":{"date-parts":[[2010,2,4]],"date-time":"2010-02-04T15:20:32Z","timestamp":1265296832000},"page":"281-290","source":"Crossref","is-referenced-by-count":25,"title":["On the one-dimensional stock cutting problem in the paper tube industry"],"prefix":"10.1007","volume":"14","author":[{"given":"Kazuki","family":"Matsumoto","sequence":"first","affiliation":[]},{"given":"Shunji","family":"Umetani","sequence":"additional","affiliation":[]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,5]]},"reference":[{"key":"164_CR1","doi-asserted-by":"crossref","first-page":"2315","DOI":"10.1016\/S0305-0548(03)00189-8","volume":"31","author":"J. C. Becceneri","year":"2004","unstructured":"Becceneri, J. C., Yanasse, H. H., & Soma, N. Y. (2004). A method for solving the minimization of the maximum number of open stacks problem within a cutting process. Computers and Operations Research, 31, 2315\u20132332.","journal-title":"Computers and Operations Research"},{"key":"164_CR2","unstructured":"Belov, G., & Scheithauer, G. (2003). The number of setups (different patterns) in one-dimensional stock cutting (Technical Report). Institute of Numerical Mathematics, Technische Universit\u00e4t Dresden."},{"key":"164_CR3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.ejor.2004.08.036","volume":"171","author":"G. Belov","year":"2006","unstructured":"Belov, G., & Scheithauer, G. (2006). A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional stock cutting and two-dimensional two-stage cutting. European Journal of Operational Research, 171, 85\u2013106.","journal-title":"European Journal of Operational Research"},{"key":"164_CR4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1287\/ijoc.1050.0132","volume":"19","author":"G. Belov","year":"2007","unstructured":"Belov, G., & Scheithauer, G. (2007). Setup and open-stacks minimization in one-dimensional stock cutting. INFORMS Journal on Computing, 19, 27\u201335.","journal-title":"INFORMS Journal on Computing"},{"key":"164_CR5","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1287\/ijoc.15.1.58.15156","volume":"15","author":"Z. Degraeve","year":"2003","unstructured":"Degraeve, Z., & Peeters, M. (2003). Optimal integer solutions to industrial cutting-stock problems: part 2, benchmark results. INFORMS Journal on Computing, 15, 58\u201381.","journal-title":"INFORMS Journal on Computing"},{"key":"164_CR6","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1287\/ijoc.11.4.406","volume":"11","author":"Z. Degraeve","year":"1999","unstructured":"Degraeve, Z., & Schrage, L. (1999). Optimal integer solutions to industrial cutting stock problems. INFORMS Journal on Computing, 11, 406\u2013419.","journal-title":"INFORMS Journal on Computing"},{"key":"164_CR7","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0305-0548(98)80001-4","volume":"26","author":"A. Fink","year":"1999","unstructured":"Fink, A., & Vo\u00df, S. (1999). Applications of modern heuristic search methods to pattern sequencing problems. Computers and Operations Research, 26, 17\u201334.","journal-title":"Computers and Operations Research"},{"key":"164_CR8","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(97)00257-9","volume":"110","author":"H. Foerster","year":"1998","unstructured":"Foerster, H., & W\u00e4scher, G. (1998). Simulated annealing for order spread minimization in sequencing cutting patterns. European Journal of Operational Research, 110, 272\u2013281.","journal-title":"European Journal of Operational Research"},{"key":"164_CR9","doi-asserted-by":"crossref","first-page":"1657","DOI":"10.1080\/002075400188780","volume":"38","author":"H. Foerster","year":"2000","unstructured":"Foerster, H., & W\u00e4scher, G. (2000). Pattern reduction in one-dimensional cutting stock problems. International Journal of Production Research, 38, 1657\u20131676.","journal-title":"International Journal of Production Research"},{"key":"164_CR10","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP -completeness. New York: Freeman."},{"key":"164_CR11","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1016\/0377-2217(95)00023-J","volume":"84","author":"T. Gau","year":"1995","unstructured":"Gau, T., & W\u00e4scher, G. (1995). CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem. European Journal of Operational Research, 84, 572\u2013579.","journal-title":"European Journal of Operational Research"},{"key":"164_CR12","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P. C. Gilmore","year":"1961","unstructured":"Gilmore, P. C., & Gomory, R. E. (1961). A linear programming approach to the cutting-stock problem. Operations Research, 9, 849\u2013859.","journal-title":"Operations Research"},{"key":"164_CR13","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"P. C. Gilmore","year":"1963","unstructured":"Gilmore, P. C., & Gomory, R. E. (1963). A linear programming approach to the cutting-stock problem\u2014part 2. Operations Research, 11, 863\u2013888.","journal-title":"Operations Research"},{"key":"164_CR14","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1287\/mnsc.17.12.B793","volume":"17","author":"R. E. Haessler","year":"1971","unstructured":"Haessler, R. E. (1971). A heuristic programming solution to a nonlinear cutting stock problem. Management Science, 17, 793\u2013802.","journal-title":"Management Science"},{"key":"164_CR15","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/opre.23.3.483","volume":"23","author":"R. E. Haessler","year":"1975","unstructured":"Haessler, R. E. (1975). Controlling cutting pattern changes in one-dimensional trim problems. Operations Research, 23, 483\u2013493.","journal-title":"Operations Research"},{"key":"164_CR16","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1057\/jors.1988.42","volume":"39","author":"O. B. G. Madsen","year":"1988","unstructured":"Madsen, O. B. G. (1988). An application of travelling-salesman routines to solve pattern-allocation problems in the glass industry. Journal of the Operational Research Society, 39, 249\u2013256.","journal-title":"Journal of the Operational Research Society"},{"key":"164_CR17","unstructured":"Makhorin, A. (2000). GLPK (GNU Linear Programming Kit). http:\/\/www.gnu.org\/software\/glpk\/ ."},{"key":"164_CR18","unstructured":"Umetani, S. (2009). Test instances for the paper tube cutting stock problem. http:\/\/www-sys.ist.osaka-u.ac.jp\/~umetani\/index-e.html ."},{"key":"164_CR19","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/S0377-2217(02)00239-4","volume":"146","author":"S. Umetani","year":"2003","unstructured":"Umetani, S., Yagiura, M., & Ibaraki, T. (2003). One-dimensional cutting stock problem to minimize the number of different patterns. European Journal of Operational Research, 146, 388\u2013402.","journal-title":"European Journal of Operational Research"},{"key":"164_CR20","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10852-005-9031-0","volume":"5","author":"S. Umetani","year":"2006","unstructured":"Umetani, S., Yagiura, M., & Ibaraki, T. (2006). One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming. Journal of Mathematical Modeling and Algorithms, 5, 43\u201364.","journal-title":"Journal of Mathematical Modeling and Algorithms"},{"key":"164_CR21","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1018346107246","volume":"9","author":"P. H. Vance","year":"1998","unstructured":"Vance, P. H. (1998). Branch-and-price algorithms for the one-dimensional cutting stock problem. Computational Optimization and Applications, 9, 211\u2013228.","journal-title":"Computational Optimization and Applications"},{"key":"164_CR22","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s101070050105","volume":"A86","author":"F. Vanderbeck","year":"1999","unstructured":"Vanderbeck, F. (1999). Computational study of a column generation algorithm for bin packing and cutting stock problems. Mathematical Programming, A86, 565\u2013594.","journal-title":"Mathematical Programming"},{"key":"164_CR23","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1016\/S0377-2217(97)84107-0","volume":"100","author":"H. H. Yanasse","year":"1997","unstructured":"Yanasse, H. H. (1997). On a pattern sequencing problem to minimize the maximum number of open stacks. European Journal of Operational Research, 100, 454\u2013463.","journal-title":"European Journal of Operational Research"},{"key":"164_CR24","doi-asserted-by":"crossref","first-page":"1353","DOI":"10.1016\/j.ejor.2005.09.054","volume":"183","author":"H. H. Yanasse","year":"2007","unstructured":"Yanasse, H. H., & Lamosa, M. J. P. (2007). An integrated cutting stock and sequencing problem. European Journal of Operational Research, 183, 1353\u20131370.","journal-title":"European Journal of Operational Research"},{"key":"164_CR25","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0377-2217(91)90222-H","volume":"55","author":"B. J. Yuen","year":"1991","unstructured":"Yuen, B. J. (1991). Heuristics for sequencing cutting patterns. European Journal of Operational Research, 55, 183\u2013190.","journal-title":"European Journal of Operational Research"},{"key":"164_CR26","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0377-2217(94)00068-N","volume":"87","author":"B. J. Yuen","year":"1995","unstructured":"Yuen, B. J. (1995). Improved heuristics for sequencing cutting patterns. European Journal of Operational Research, 87, 57\u201364.","journal-title":"European Journal of Operational Research"},{"key":"164_CR27","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1016\/0377-2217(95)00025-L","volume":"84","author":"B. J. Yuen","year":"1995","unstructured":"Yuen, B. J., & Richardson, K. V. (1995). Establishing the optimality of sequencing heuristics for cutting stock problems. European Journal of Operational Research, 84, 590\u2013598.","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0164-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0164-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0164-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:44Z","timestamp":1559453984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0164-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,5]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["164"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0164-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,5]]}}}