IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v183y2007i3p1353-1370.html
   My bibliography  Save this article

An integrated cutting stock and sequencing problem

Author

Listed:
  • Yanasse, Horacio Hideki
  • Pinto Lamosa, Maria Jose

Abstract

No abstract is available for this item.

Suggested Citation

  • Yanasse, Horacio Hideki & Pinto Lamosa, Maria Jose, 2007. "An integrated cutting stock and sequencing problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1353-1370, December.
    • Handle: RePEc:eee:ejores:v:183:y:2007:i:3:p:1353-1370
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00309-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Nicos Christofides & Charles Whitlock, 1977. "An Algorithm for Two-Dimensional Cutting Problems," Operations Research, INFORMS, vol. 25(1), pages 30-44, February.
    2. Hifi, Mhand, 1997. "The DH/KD algorithm: a hybrid approach for unconstrained two-dimensional cutting problems," European Journal of Operational Research, Elsevier, vol. 97(1), pages 41-52, February.
    3. Yuen, Boon J., 1991. "Heuristics for sequencing cutting patterns," European Journal of Operational Research, Elsevier, vol. 55(2), pages 183-190, November.
    4. Lodi, Andrea & Martello, Silvano & Monaci, Michele, 2002. "Two-dimensional packing problems: A survey," European Journal of Operational Research, Elsevier, vol. 141(2), pages 241-252, September.
    5. Hinxman, A. I., 1980. "The trim-loss and assortment problems: A survey," European Journal of Operational Research, Elsevier, vol. 5(1), pages 8-18, July.
    6. Christopher S. Tang & Eric V. Denardo, 1988. "Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches," Operations Research, INFORMS, vol. 36(5), pages 767-777, October.
    7. Pisinger, David, 1995. "An expanding-core algorithm for the exact 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 87(1), pages 175-187, November.
    8. Mhand Hifi & Catherine Roucairol, 2001. "Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems," Journal of Combinatorial Optimization, Springer, vol. 5(4), pages 465-494, December.
    9. Oliveira, JoseFernando & Ferreira, JoseSoeiro, 1990. "An improved version of Wang's algorithm for two-dimensional cutting problems," European Journal of Operational Research, Elsevier, vol. 44(2), pages 256-266, January.
    10. Faggioli, Enrico & Bentivoglio, Carlo Alberto, 1998. "Heuristic and exact methods for the cutting sequencing problem," European Journal of Operational Research, Elsevier, vol. 110(3), pages 564-575, November.
    11. Dowsland, Kathryn A. & Dowsland, William B., 1992. "Packing problems," European Journal of Operational Research, Elsevier, vol. 56(1), pages 2-14, January.
    12. Arenales, Marcos & Morabito, Reinaldo, 1995. "An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems," European Journal of Operational Research, Elsevier, vol. 84(3), pages 599-617, August.
    13. J. E. Beasley, 1985. "An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure," Operations Research, INFORMS, vol. 33(1), pages 49-64, February.
    14. Christofides, Nicos & Hadjiconstantinou, Eleni, 1995. "An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts," European Journal of Operational Research, Elsevier, vol. 83(1), pages 21-38, May.
    15. P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
    16. Soma, Nei Yoshihiro & Toth, Paolo, 2002. "An exact algorithm for the subset sum problem," European Journal of Operational Research, Elsevier, vol. 136(1), pages 57-66, January.
    17. Pisinger, David, 1995. "A minimal algorithm for the multiple-choice knapsack problem," European Journal of Operational Research, Elsevier, vol. 83(2), pages 394-410, June.
    18. Parada Daza, Victor & Gomes de Alvarenga, Arlindo & de Diego, Jose, 1995. "Exact solutions for constrained two-dimensional cutting problems," European Journal of Operational Research, Elsevier, vol. 84(3), pages 633-644, August.
    19. Yuen, Boon J., 1995. "Improved heuristics for sequencing cutting patterns," European Journal of Operational Research, Elsevier, vol. 87(1), pages 57-64, November.
    20. Yuen, Boon J. & Richardson, Ken V., 1995. "Establishing the optimality of sequencing heuristics for cutting stock problems," European Journal of Operational Research, Elsevier, vol. 84(3), pages 590-598, August.
    21. Yanasse, Horacio Hideki, 1997. "On a pattern sequencing problem to minimize the maximum number of open stacks," European Journal of Operational Research, Elsevier, vol. 100(3), pages 454-463, August.
    22. P. Y. Wang, 1983. "Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems," Operations Research, INFORMS, vol. 31(3), pages 573-586, June.
    23. Stadtler, Hartmut, 1990. "A one-dimensional cutting stock problem in the aluminium industry and its solution," European Journal of Operational Research, Elsevier, vol. 44(2), pages 209-223, January.
    24. P. C. Gilmore & R. E. Gomory, 1963. "A Linear Programming Approach to the Cutting Stock Problem---Part II," Operations Research, INFORMS, vol. 11(6), pages 863-888, December.
    25. Harald Dyckhoff, 1981. "A New Linear Programming Approach to the Cutting Stock Problem," Operations Research, INFORMS, vol. 29(6), pages 1092-1104, December.
    26. Riehme, Jan & Scheithauer, Guntram & Terno, Johannes, 1996. "The solution of two-stage guillotine cutting stock problems having extremely varying order demands," European Journal of Operational Research, Elsevier, vol. 91(3), pages 543-552, June.
    27. Armbruster, Michael, 2002. "A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry," European Journal of Operational Research, Elsevier, vol. 141(2), pages 328-340, September.
    28. P. C. Gilmore & R. E. Gomory, 1965. "Multistage Cutting Stock Problems of Two and More Dimensions," Operations Research, INFORMS, vol. 13(1), pages 94-120, February.
    29. Morabito, Reinaldo & Arenales, Marcos N., 1996. "Staged and constrained two-dimensional guillotine cutting problems: An AND/OR-graph approach," European Journal of Operational Research, Elsevier, vol. 94(3), pages 548-560, November.
    30. Dyckhoff, Harald, 1990. "A typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 44(2), pages 145-159, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Anselmo Ramalho Pitombeira-Neto & Bruno de Athayde Prata, 2020. "A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(1), pages 178-192, April.
    2. Reinertsen, Harald & Vossen, Thomas W.M., 2010. "The one-dimensional cutting stock problem with due dates," European Journal of Operational Research, Elsevier, vol. 201(3), pages 701-711, March.
    3. Kallrath, Julia & Rebennack, Steffen & Kallrath, Josef & Kusche, Rüdiger, 2014. "Solving real-world cutting stock-problems in the paper industry: Mathematical approaches, experience and challenges," European Journal of Operational Research, Elsevier, vol. 238(1), pages 374-389.
    4. Kennedy A. G. Araújo & Tibérius O. Bonates & Bruno A. Prata & Anselmo R. Pitombeira-Neto, 2021. "Heterogeneous prestressed precast beams multiperiod production planning problem: modeling and solution methods," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(3), pages 660-693, October.
    5. Arbib, Claudio & Felici, Giovanni & Servilio, Mara, 2019. "Common operation scheduling with general processing times: A branch-and-cut algorithm to minimize the weighted number of tardy jobs," Omega, Elsevier, vol. 84(C), pages 18-30.
    6. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    7. Gislaine Mara Melega & Silvio Alexandre de Araujo & Reinaldo Morabito, 2020. "Mathematical model and solution approaches for integrated lot-sizing, scheduling and cutting stock problems," Annals of Operations Research, Springer, vol. 295(2), pages 695-736, December.
    8. Wuttke, David A. & Heese, H. Sebastian, 2018. "Two-dimensional cutting stock problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 265(1), pages 303-315.
    9. Matthias Kaltenbrunner & Maria Anna Huka & Manfred Gronalt, 2022. "Heuristic based approach for short term production planning in highly automated customer oriented pallet production," Journal of Intelligent Manufacturing, Springer, vol. 33(4), pages 1087-1098, April.
    10. Arbib, Claudio & Marinelli, Fabrizio & Pezzella, Ferdinando, 2012. "An LP-based tabu search for batch scheduling in a cutting process with finite buffers," International Journal of Production Economics, Elsevier, vol. 136(2), pages 287-296.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    2. Morabito, Reinaldo & Belluzzo, Luciano, 2007. "Optimising the cutting of wood fibre plates in the hardboard industry," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1405-1420, December.
    3. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    4. Song, X. & Chu, C.B. & Lewis, R. & Nie, Y.Y. & Thompson, J., 2010. "A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting," European Journal of Operational Research, Elsevier, vol. 202(2), pages 368-378, April.
    5. Hoto, Robinson & Arenales, Marcos & Maculan, Nelson, 2007. "The one dimensional Compartmentalised Knapsack Problem: A case study," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1183-1195, December.
    6. Hadjiconstantinou, Eleni & Iori, Manuel, 2007. "A hybrid genetic algorithm for the two-dimensional single large object placement problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1150-1166, December.
    7. Silva, Elsa & Oliveira, José Fernando & Silveira, Tiago & Mundim, Leandro & Carravilla, Maria Antónia, 2023. "The Floating-Cuts model: a general and flexible mixed-integer programming model for non-guillotine and guillotine rectangular cutting problems," Omega, Elsevier, vol. 114(C).
    8. Iori, Manuel & de Lima, Vinícius L. & Martello, Silvano & Miyazawa, Flávio K. & Monaci, Michele, 2021. "Exact solution techniques for two-dimensional cutting and packing," European Journal of Operational Research, Elsevier, vol. 289(2), pages 399-415.
    9. Mhand Hifi, 2004. "Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock Problems," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 65-84, March.
    10. Cintra, G.F. & Miyazawa, F.K. & Wakabayashi, Y. & Xavier, E.C., 2008. "Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation," European Journal of Operational Research, Elsevier, vol. 191(1), pages 61-85, November.
    11. Igor Kierkosz & Maciej Luczak, 2014. "A hybrid evolutionary algorithm for the two-dimensional packing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(4), pages 729-753, December.
    12. Hadjiconstantinou, Eleni & Christofides, Nicos, 1995. "An exact algorithm for general, orthogonal, two-dimensional knapsack problems," European Journal of Operational Research, Elsevier, vol. 83(1), pages 39-56, May.
    13. Baldacci, Roberto & Boschetti, Marco A., 2007. "A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1136-1149, December.
    14. Morabito, Reinaldo & Arenales, Marcos N., 1996. "Staged and constrained two-dimensional guillotine cutting problems: An AND/OR-graph approach," European Journal of Operational Research, Elsevier, vol. 94(3), pages 548-560, November.
    15. Fabio Furini & Enrico Malaguti & Dimitri Thomopulos, 2016. "Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 736-751, November.
    16. Song, X. & Chu, C.B. & Nie, Y.Y. & Bennell, J.A., 2006. "An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1870-1889, December.
    17. Ortmann, Frank G. & Ntene, Nthabiseng & van Vuuren, Jan H., 2010. "New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems," European Journal of Operational Research, Elsevier, vol. 203(2), pages 306-315, June.
    18. Vera Neidlein & Andrèa C. G. Vianna & Marcos N. Arenales & Gerhard Wäscher, 2008. "The Two-Dimensional, Rectangular, Guillotineable-Layout Cutting Problem with a Single Defect," FEMM Working Papers 08035, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    19. Armbruster, Michael, 2002. "A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry," European Journal of Operational Research, Elsevier, vol. 141(2), pages 328-340, September.
    20. Reinaldo Morabito & Vitória Pureza, 2010. "A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem," Annals of Operations Research, Springer, vol. 179(1), pages 297-315, September.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:183:y:2007:i:3:p:1353-1370. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.