IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v59y2008i11d10.1057_palgrave.jors.2602494.html
   My bibliography  Save this article

New integer programming formulations and an exact algorithm for the ordered cutting stock problem

Author

Listed:
  • C Alves

    (Universidade do Minho)

  • J M Valério de Carvalho

    (Universidade do Minho)

Abstract

Apart from trim loss minimization, there are many other issues concerning cutting processes that arise in real production systems. One of these is related to the number of stacks that need to be opened near the cutting machines. Many researchers have worked in the last years on cutting stock problems with additional constraints on the number of open stacks. In this paper, we address a related problem: the Ordered Cutting Stock Problem (OCSP). In this case, a stack is opened for every new client's order, and it is closed only when all the items of that order are cut. The OSCP has been introduced recently in the literature. Our aim is to provide further insight into this problem. This paper describes three new integer programming formulations for solving it, and an exact algorithm based on column generation, branch-and-bound and cutting planes. We report on computational experiments on a set of random instances. The results show that good lower bounds can be computed quickly, and that optimal solutions can be found in a reasonable amount of time.

Suggested Citation

  • C Alves & J M Valério de Carvalho, 2008. "New integer programming formulations and an exact algorithm for the ordered cutting stock problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(11), pages 1520-1531, November.
    • Handle: RePEc:pal:jorsoc:v:59:y:2008:i:11:d:10.1057_palgrave.jors.2602494
    DOI: 10.1057/palgrave.jors.2602494
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602494
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2602494?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. 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.
    2. Chen, Chuen-Lung S. & Hart, Stephen M. & Tham, Wai Mui, 1996. "A simulated annealing heuristic for the one-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 93(3), pages 522-535, September.
    3. Umetani, Shunji & Yagiura, Mutsunori & Ibaraki, Toshihide, 2003. "One-dimensional cutting stock problem to minimize the number of different patterns," European Journal of Operational Research, Elsevier, vol. 146(2), pages 388-402, April.
    4. 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.
    5. A. A. Farley, 1990. "A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems," Operations Research, INFORMS, vol. 38(5), pages 922-923, October.
    6. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    7. Robert W. Haessler, 1971. "A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem," Management Science, INFORMS, vol. 17(12), pages 793-802, August.
    8. Daniel Villeneuve & Jacques Desrosiers & Marco Lübbecke & François Soumis, 2005. "On Compact Formulations for Integer Programs Solved by Column Generation," Annals of Operations Research, Springer, vol. 139(1), pages 375-388, October.
    9. Alves, Claudio & Valerio de Carvalho, J.M., 2007. "Accelerating column generation for variable sized bin-packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1333-1352, December.
    10. François Vanderbeck, 2000. "Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem," Operations Research, INFORMS, vol. 48(6), pages 915-926, December.
    Full references (including those not matched with items on IDEAS)

    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. Tao Wu & Kerem Akartunal? & Raf Jans & Zhe Liang, 2017. "Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 523-543, August.
    2. Hajizadeh, Iman & Lee, Chi-Guhn, 2007. "Alternative configurations for cutting machines in a tube cutting mill," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1385-1396, December.
    3. Ramiro Varela & Camino Vela & Jorge Puente & María Sierra & Inés González-Rodríguez, 2009. "An effective solution for a real cutting stock problem in manufacturing plastic rolls," Annals of Operations Research, Springer, vol. 166(1), pages 125-146, February.
    4. François Clautiaux & Cláudio Alves & José Valério de Carvalho & Jürgen Rietz, 2011. "New Stabilization Procedures for the Cutting Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 530-545, November.
    5. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    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. 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.
    8. Aktin, Tülin & Özdemir, RIfat Gürcan, 2009. "An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing," European Journal of Operational Research, Elsevier, vol. 196(2), pages 737-743, July.
    9. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    10. 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.
    11. Morgan, Leslie O. & Morton, Alysse R. & Daniels, Richard L., 2006. "Simultaneously determining the mix of space launch vehicles and the assignment of satellites to rockets," European Journal of Operational Research, Elsevier, vol. 172(3), pages 747-760, August.
    12. Umetani, Shunji & Yagiura, Mutsunori & Ibaraki, Toshihide, 2003. "One-dimensional cutting stock problem to minimize the number of different patterns," European Journal of Operational Research, Elsevier, vol. 146(2), pages 388-402, April.
    13. Muter, İbrahim & Sezer, Zeynep, 2018. "Algorithms for the one-dimensional two-stage cutting stock problem," European Journal of Operational Research, Elsevier, vol. 271(1), pages 20-32.
    14. Malaguti, Enrico & Medina Durán, Rosa & Toth, Paolo, 2014. "Approaches to real world two-dimensional cutting problems," Omega, Elsevier, vol. 47(C), pages 99-115.
    15. Silva, Eduardo M. & Melega, Gislaine M. & Akartunalı, Kerem & de Araujo, Silvio A., 2023. "Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost," European Journal of Operational Research, Elsevier, vol. 304(2), pages 443-460.
    16. Wang, Danni & Xiao, Fan & Zhou, Lei & Liang, Zhe, 2020. "Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation," European Journal of Operational Research, Elsevier, vol. 286(2), pages 547-563.
    17. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    18. Zak, Eugene J., 2002. "Modeling multistage cutting stock problems," European Journal of Operational Research, Elsevier, vol. 141(2), pages 313-327, September.
    19. Zeger Degraeve & Linus Schrage, 1999. "Optimal Integer Solutions to Industrial Cutting Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 11(4), pages 406-419, November.
    20. Kelly Cristina Poldi & Silvio Alexandre Araujo, 2016. "Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem," Annals of Operations Research, Springer, vol. 238(1), pages 497-520, March.

    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:pal:jorsoc:v:59:y:2008:i:11:d:10.1057_palgrave.jors.2602494. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.