Log in

Relevant bibliographies by topics / Cutting stock problems / Journal articles

To see the other types of publications on this topic, follow the link: Cutting stock problems.

Journal articles on the topic 'Cutting stock problems'

Author: Grafiati

Published: 4 June 2021

Last updated: 4 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Cutting stock problems.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Zak, Eugene J. "Modeling multistage cutting stock problems." European Journal of Operational Research 141, no. 2 (2002): 313–27. http://dx.doi.org/10.1016/s0377-2217(02)00127-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

McDiarmid, Colin. "Pattern minimisation in cutting stock problems." Discrete Applied Mathematics 98, no. 1-2 (1999): 121–30. http://dx.doi.org/10.1016/s0166-218x(99)00112-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Haessler, Robert W., and Paul E. Sweeney. "Cutting stock problems and solution procedures." European Journal of Operational Research 54, no. 2 (1991): 141–50. http://dx.doi.org/10.1016/0377-2217(91)90293-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Crispin, Alan J., and Kai Cheng. "Backtracking Greedy Algorithm for Cutting Stock Problems." Applied Mechanics and Materials 10-12 (December 2007): 203–7. http://dx.doi.org/10.4028/www.scientific.net/amm.10-12.203.

Full text

Abstract:

This paper presents a greedy search placement algorithm which incorporates backtracking for the leather stock cutting problem. In the leather manufacturing industry the efficient cutting of component parts (stencils) form a hide is of prime importance to maintain profitability. Consequently, the development of new approaches for generating cut-plans that minimise material waste and which can handle problem constraints have practical value. The unique feature of the greedy placement algorithm method presented in this paper is that it incorporates backtracking which allows previous placement ste

APA, Harvard, Vancouver, ISO, and other styles

5

H. Daǧli, Cihan. "Knowledge-based systems for cutting stock problems." European Journal of Operational Research 44, no. 2 (1990): 160–66. http://dx.doi.org/10.1016/0377-2217(90)90351-b.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

MUKHACHIOVA, E. A., and V. A. ZALGALLER. "LINEAR PROGRAMMING CUTTING PROBLEMS." International Journal of Software Engineering and Knowledge Engineering 03, no. 04 (1993): 463–76. http://dx.doi.org/10.1142/s0218194093000240.

Full text

Abstract:

Different optimal cutting problems are considered in this paper. Among them are cutting forming problems (closed packing problems) and problems of cutting totality planning with intensities of their application. For solving these planning problems, linear or integer programming is used. Furthermore, different cutting technological and organizational situations are considered. Different optimal criteria and a compromise solution choice procedure are presented. All the statements are illustrated by numerical examples from a guillotine cutting area. The possibility of linear cutting approximation

APA, Harvard, Vancouver, ISO, and other styles

7

Kiwiel, Krzysztof C. "An Inexact Bundle Approach to Cutting-Stock Problems." INFORMS Journal on Computing 22, no. 1 (2010): 131–43. http://dx.doi.org/10.1287/ijoc.1090.0326.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Degraeve, Zeger, and Linus Schrage. "Optimal Integer Solutions to Industrial Cutting Stock Problems." INFORMS Journal on Computing 11, no. 4 (1999): 406–19. http://dx.doi.org/10.1287/ijoc.11.4.406.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Golfeto, Rodrigo Rabello, Antônio Carlos Moretti, and Luiz Leduíno De Salles Neto. "INTELCSP: computational intelligence applied to cutting stock problems." International Journal of Computational Intelligence Studies 1, no. 4 (2012): 312. http://dx.doi.org/10.1504/ijcistudies.2012.050354.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

DAGLI, CİHAN H., and M. YALÇIN TATOGLU. "An approach to two-dimensional cutting stock problems." International Journal of Production Research 25, no. 2 (1987): 175–90. http://dx.doi.org/10.1080/00207548708919832.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Foerster, Hildegard, and Gerhard Wascher. "Pattern reduction in one-dimensional cutting stock problems." International Journal of Production Research 38, no. 7 (2000): 1657–76. http://dx.doi.org/10.1080/002075400188780.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Rietz, J., and S. Dempe. "Large gaps in one-dimensional cutting stock problems." Discrete Applied Mathematics 156, no. 10 (2008): 1929–35. http://dx.doi.org/10.1016/j.dam.2007.08.052.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Haessler, Robert W. "One-dimensional cutting stock problems and solution procedures." Mathematical and Computer Modelling 16, no. 1 (1992): 1–8. http://dx.doi.org/10.1016/0895-7177(92)90074-u.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Sugi, Masao, Yusuke Shiomi, Tsuyoshi Okubo, Kazuyoshi Inoue, and Jun Ota. "A Solution for 2D Rectangular Cutting Stock Problems with 3-Stage Guillotine-Cutting Constraint." International Journal of Automation Technology 4, no. 5 (2010): 461–68. http://dx.doi.org/10.20965/ijat.2010.p0461.

Full text

Abstract:

The cutting stock problem (CSP) adversely affecting processing industry profits has been studied aggressively in mathematical planning but the results are not often used at real production sites and solutions are often still found manually by experienced personnel because real processing constraints have not been focused on. This paper deals with the 2-dimensional rectangular cutting stock problem (2DRCSP) in which the shape of a cut piece is rectangular, assuming a roll-shaped stock often used in actual processing and proposing a solution taking processing called 3-stage guillotine cutting in

APA, Harvard, Vancouver, ISO, and other styles

15

Scheithauer, G., J. Terno, A. Müller, and G. Belov. "Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm." Journal of the Operational Research Society 52, no. 12 (2001): 1390–401. http://dx.doi.org/10.1057/palgrave.jors.2601242.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Zheng, Wu, Bing Li, Kuo Ran Yang, and Hang Li. "Triangle Rectangle Method for 2D Irregular Cutting-Stock Problems." Applied Mechanics and Materials 130-134 (October 2011): 2090–93. http://dx.doi.org/10.4028/www.scientific.net/amm.130-134.2090.

Full text

Abstract:

The goal of 2D irregular cutting-stock problems is to make the remaining materials reduce to a minimum in the cutting process, making the maximum utilization of raw materials. This paper proposed “Triangle rectangle method”. First, turn the irregular shapes of parts into the smallest triangle or quadrilateral, if it is a quadrilateral, turn the quadrilateral to the smallest triangle and turn the triangle to the smallest right triangle, then make the two same smallest right triangles coincide as a rectangular along the longest side of the envelope .At last, follow Rectangular envelope method, t

APA, Harvard, Vancouver, ISO, and other styles

17

Valério de Carvalho, J. M. "LP models for bin packing and cutting stock problems." European Journal of Operational Research 141, no. 2 (2002): 253–73. http://dx.doi.org/10.1016/s0377-2217(02)00124-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Roodman, Gary M. "Near-optimal solutions to one-dimensional cutting stock problems." Computers & Operations Research 13, no. 6 (1986): 713–19. http://dx.doi.org/10.1016/0305-0548(86)90077-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Raffensperger, John F. "The generalized assortment and best cutting stock length problems." International Transactions in Operational Research 17, no. 1 (2010): 35–49. http://dx.doi.org/10.1111/j.1475-3995.2009.00724.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Silva, E., F. Alvelos, and J. M. Valério de Carvalho. "Integrating two-dimensional cutting stock and lot-sizing problems." Journal of the Operational Research Society 65, no. 1 (2014): 108–23. http://dx.doi.org/10.1057/jors.2013.25.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Delorme, Maxence, Manuel Iori, and Silvano Martello. "Logic based Benders' decomposition for orthogonal stock cutting problems." Computers & Operations Research 78 (February 2017): 290–98. http://dx.doi.org/10.1016/j.cor.2016.09.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Cintra, G. F., F. K. Miyazawa, Y. Wakabayashi, and E. C. Xavier. "A note on the approximability of cutting stock problems." European Journal of Operational Research 183, no. 3 (2007): 1328–32. http://dx.doi.org/10.1016/j.ejor.2005.09.053.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

de Queiroz, Thiago A., Flávio K. Miyazawa, Yoshiko Wakabayashi, and Eduardo C. Xavier. "Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing." Computers & Operations Research 39, no. 2 (2012): 200–212. http://dx.doi.org/10.1016/j.cor.2011.03.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Li, Yan Cang, Juan Juan Suo, and Shu Jing Zhou. "Improved ACO for Dimensional Cutting-Stock Problem." Applied Mechanics and Materials 26-28 (June 2010): 277–80. http://dx.doi.org/10.4028/www.scientific.net/amm.26-28.277.

Full text

Abstract:

In order to find an effective method for solving the NP problem-dimensional cutting stock problem, the improved ACO based on entropy was introduced．After introducing the basic knowledge of the improved ACO, the dimensional cutting-stock problem’s mathematical model was set up．And the improved ACO was employed to optimize the problem．Computed results indicate that the ant colony algorithm can approach the theoretical optimal solution，and its astringency is good．This study provides a new approach for the optimization of the NP hard problems.

APA, Harvard, Vancouver, ISO, and other styles

25

Chu, Chengbin, and Julien Antonio. "Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems." Operations Research 47, no. 4 (1999): 495–508. http://dx.doi.org/10.1287/opre.47.4.495.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Yuen, Boon J., and Ken V. Richardson. "Establishing the optimality of sequencing heuristics for cutting stock problems." European Journal of Operational Research 84, no. 3 (1995): 590–98. http://dx.doi.org/10.1016/0377-2217(95)00025-l.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Delorme, Maxence, Manuel Iori, and Silvano Martello. "BPPLIB: a library for bin packing and cutting stock problems." Optimization Letters 12, no. 2 (2017): 235–50. http://dx.doi.org/10.1007/s11590-017-1192-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Klempous, Ryszard, Jerzy Kotowski, and Ewa Szlachcic. "Interactive procedures in large-scale two-dimensional cutting stock problems." Journal of Computational and Applied Mathematics 66, no. 1-2 (1996): 323–31. http://dx.doi.org/10.1016/0377-0427(95)00200-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Gradisar, Miro, Jure Erjavec, and Luka Tomat. "One-Dimensional Cutting Stock Optimization with Usable Leftover." International Journal of Decision Support System Technology 3, no. 1 (2011): 54–66. http://dx.doi.org/10.4018/jdsst.2011010104.

Full text

Abstract:

This paper describes a method for solving one-dimensional cutting stock problem with usable leftover (CSPUL) in cases where the ratio between the average stock and average order length is less than 3. The proposed method can solve general CSPUL where standard stock lengths, non-standard stock lengths, or a combination of both are cut in the exact required number of pieces. The solutions of sample problems are compared with other methods.

APA, Harvard, Vancouver, ISO, and other styles

30

Wang, Fu-Kwun, and Feng-Tai Liu. "Flexible Stock Allocation and Trim Loss Control for Cutting Problem in the Industrial-Use Paper Production." Mathematical Problems in Engineering 2014 (2014): 1–9. http://dx.doi.org/10.1155/2014/521386.

Full text

Abstract:

We consider a one-dimensional cutting stock problem (CSP) in which the stock widths are not used to fulfill the order but kept for use in the future for the industrial-use paper production. We present a new model based on the flexible stock allocation and trim loss control to determine the production quantity. We evaluate our approach using a real data and show that we are able to solve industrial-size problems, while also addressing common cutting considerations such as aggregation of orders, multiple stock widths, and cutting different patterns on the same machine. In addition, we compare ou

APA, Harvard, Vancouver, ISO, and other styles

31

Farley, A. A. "A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems." Operations Research 38, no. 5 (1990): 922–23. http://dx.doi.org/10.1287/opre.38.5.922.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Farley, Alan A. "Mathematical Programming Models for Cutting-Stock Problems in the Clothing Industry." Journal of the Operational Research Society 39, no. 1 (1988): 41. http://dx.doi.org/10.2307/2581997.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Farley, Alan A. "Mathematical Programming Models for Cutting-Stock Problems in the Clothing Industry." Journal of the Operational Research Society 39, no. 1 (1988): 41–53. http://dx.doi.org/10.1057/jors.1988.6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Delorme, Maxence, and Manuel Iori. "Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems." INFORMS Journal on Computing 32, no. 1 (2020): 101–19. http://dx.doi.org/10.1287/ijoc.2018.0880.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Andrade, R., E. G. Birgin, and R. Morabito. "Two-stage two-dimensional guillotine cutting stock problems with usable leftover." International Transactions in Operational Research 23, no. 1-2 (2014): 121–45. http://dx.doi.org/10.1111/itor.12077.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Viswanathan, K. V., and A. Bagchi. "Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems." Operations Research 41, no. 4 (1993): 768–76. http://dx.doi.org/10.1287/opre.41.4.768.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Campello, B. S. C., C. T. L. S. Ghidini, A. O. C. Ayres, and W. A. Oliveira. "A multiobjective integrated model for lot sizing and cutting stock problems." Journal of the Operational Research Society 71, no. 9 (2019): 1466–78. http://dx.doi.org/10.1080/01605682.2019.1619892.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Delorme, Maxence, Manuel Iori, and Silvano Martello. "Bin packing and cutting stock problems: Mathematical models and exact algorithms." European Journal of Operational Research 255, no. 1 (2016): 1–20. http://dx.doi.org/10.1016/j.ejor.2016.04.030.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Wäscher, Gerhard. "An LP-based approach to cutting stock problems with multiple objectives." European Journal of Operational Research 44, no. 2 (1990): 175–84. http://dx.doi.org/10.1016/0377-2217(90)90353-d.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Farley, A. A. "Practical adaptations of the Gilmore-Gomory approach to cutting stock problems." OR Spektrum 10, no. 2 (1988): 113–23. http://dx.doi.org/10.1007/bf01720210.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Meadows, James S., and Daniel A. Skojac. "A New Tree Classification System for Southern Hardwoods." Southern Journal of Applied Forestry 32, no. 2 (2008): 69–79. http://dx.doi.org/10.1093/sjaf/32.2.69.

Full text

Abstract:

Abstract A new tree classification system for southern hardwoods is described. The new system is based on the Putnam tree classification system, originally developed by Putnam et al., 1960, Management and inventory of southern hardwoods, Agriculture Handbook 181, US For. Serv., Washington, C, which consists of four tree classes: (1) preferred growing stock, (2) reserve growing stock, (3) cutting stock, and (4) cull stock. Tree classes under the Putnam system are used as a basis for planning partial cuttings and for developing marking rules in southern hardwood forests. However, there are criti

APA, Harvard, Vancouver, ISO, and other styles

42

Xie, Wen Wu, and Tao Ning. "Genetic Algorithm for Panel Cutting Stock on CUDA Platform." Advanced Materials Research 712-715 (June 2013): 2569–75. http://dx.doi.org/10.4028/www.scientific.net/amr.712-715.2569.

Full text

Abstract:

The problem of placing a number of specific shapes on a raw material in order to maximize material utilization is commonly encountered in the production of steel bars and plates, papers, glasses, etc. In this paper, we presented a genetic algorithm for steel grating nesting design. For application in large-scale discrete optimization problems, we also implemented this algorithm with CUDA based on parallel computation. Experimental results show that under genetic algorithm invoking with CUDA scheme, we can obtain satisfied solutions to steel grating nesting problem with high performance.

APA, Harvard, Vancouver, ISO, and other styles

43

Fayard, D., M. Hifi, and V. Zissimopoulos. "An Efficient Approach for Large-Scale Two-Dimensional Guillotine Cutting Stock Problems." Journal of the Operational Research Society 49, no. 12 (1998): 1270. http://dx.doi.org/10.2307/3010152.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Johnston, Robert E., and Enes Sadinlija. "A new model for complete solutions to one-dimensional cutting stock problems." European Journal of Operational Research 153, no. 1 (2004): 176–83. http://dx.doi.org/10.1016/s0377-2217(02)00704-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Liang, Ko-Hsin, Xin Yao, Charles Newton, and David Hoffman. "A new evolutionary approach to cutting stock problems with and without contiguity." Computers & Operations Research 29, no. 12 (2002): 1641–59. http://dx.doi.org/10.1016/s0305-0548(01)00039-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Fayard, D., M. Hifi, and V. Zissimopoulos. "An efficient approach for large-scale two-dimensional guillotine cutting stock problems." Journal of the Operational Research Society 49, no. 12 (1998): 1270–77. http://dx.doi.org/10.1057/palgrave.jors.2600638.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Degraeve, Zeger, and Marc Peeters. "Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results." INFORMS Journal on Computing 15, no. 1 (2003): 58–81. http://dx.doi.org/10.1287/ijoc.15.1.58.15156.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Vasko, Francis J., and Christopher L. Bartkowski. "Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems." International Transactions in Operational Research 16, no. 6 (2009): 829–38. http://dx.doi.org/10.1111/j.1475-3995.2009.00708.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Fayard, D., M. Hifi, and V. Zissimopoulos. "An efficient approach for large-scale two-dimensional guillotine cutting stock problems." Journal of the Operational Research Society 49, no. 12 (1998): 1270–77. http://dx.doi.org/10.1038/sj.jors.2600638.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Melega, Gislaine Mara, Silvio Alexandre de Araujo, and Raf Jans. "Classification and literature review of integrated lot-sizing and cutting stock problems." European Journal of Operational Research 271, no. 1 (2018): 1–19. http://dx.doi.org/10.1016/j.ejor.2018.01.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!