Skip to main content
SpringerLink
Log in

An integer programming approach for the 2-schemes strip cutting problem with a sequencing constraint

  • Published:
Optimization and Engineering Aims and scope Submit manuscript

Abstract

We study integer programming formulations for the 2-schemes strip cutting problem with a sequencing constraint (2-SSCPsc) considered by Rinaldi and Franz. The 2-SSCPsc arises in the context of corrugated cardboard production, which involves cutting strips of large lengths into rectangles of at most (usually) two different lengths. Because of buffer restrictions, in the 2-SSCPsc these strips must be sequenced in such a way that, at any moment, at most two types of items are in production and not completed yet. This problem is NP-hard. We present four integer programming formulations for this problem, and our computational experiments with real-life instances show that one of them has a very tight integrality gap. We propose a heuristic procedure based on this formulation and present computational experience showing that this procedure finds very good primal solutions in small running times.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Becceneri J, Hideki H, Soma N (2004) A method for solving the minimization of the maximum number of open stacks problem within a cutting process. Comput Oper Res 31:2315–2332

    Article  MATH  Google Scholar 

  • Berinsky H (2010) Un modelo y algoritmo branch-and-cut para el problema del \(m\)-anillo-estrella con capacidades (in Spanish). MSc Thesis, Computer Science Dept., FCEyN, University of Buenos Aires, 2010

  • Bolat A (2000) An extended scheduling model for producing corrugated boxes. Int J Prod Res 38:1579–1599

    Article  MATH  Google Scholar 

  • Bonomo F, Durán G, Grippo L, Safe M (2009) Partial characterizations of circular-arc graphs. J Graph Theory 61–4:289–306

    Article  Google Scholar 

  • Koch T (2004) Rapid mathematical programming. PhD Thesis, Technische Universität Berlin, 2004

  • Lekkerkerker CG, Boland JCh (1962) Representation of a finite graph by a set of intervals on the real line. Fundam Math 51:45–64

    MATH  MathSciNet  Google Scholar 

  • Lins S (1989) Traversing trees and scheduling tasks for duplex corrugator machines. Pesqui Operacional 9:40–54

    Google Scholar 

  • Linhares A, Hideki H (2002) Connections between cutting-pattern sequencing, VLSI design, and flexible machines. Comput Oper Res 29:1759–1772

    Article  MATH  Google Scholar 

  • Lucero S (2012) Métodos basados en programación lineal entera para el problema de planificación de corrugadoras por tramos consecutivos (in Spanish). MSc Thesis, Computer Science Dept., FCEyN, University of Buenos Aires

  • Pinto M, Yanasse H (2004) A heuristic to solve the cutting and sequencing integrated problem (in Portuguese). XXXVI Simpósio Brasileiro de Pesquisa Operacional, 2004

  • Pinto M, Yanasse H (2005) Solution of the cutting and sequencing integrated problem by lagrangian relaxation. XXXVII Simpósio Brasileiro de Pesquisa Operacional, 2005

  • Rinaldi F, Franz A (2007) A two-dimensional strip cutting problem with sequencing constraint. Eur J Oper Res 183:1371–1384

    Article  MATH  MathSciNet  Google Scholar 

  • Yanasse H (1996) Minimization of open orders—polynomial algorithms for some special cases. Pesqui Operacional 16–1:1–26

    Google Scholar 

  • Yanasse H (1997) A transformation for solving a pattern sequencing problem in the wood cut industry. Pesqui Operacional 17–1:57–70

    Google Scholar 

  • Yanasse H (1997) An exact algorithm for the tree case of the minimization of open orders problem. XXIX Simpósio Brasileiro de Pesquisa Operacional, 1997. INPE Technical Report LAC-001/97

  • Yanasse H (1997) On a pattern sequencing problem to minimize the maximum number of open stacks. Eur J Oper Res 100:454–463

    Article  MATH  Google Scholar 

  • Yanasse H, Pinto M (2005) A lagrangian approach to solve a cutting stock problem under a particular pattern sequencing constraints. V ALIO/EURO conference on combinatorial optimizatio, 2005

  • Yanasse H, Lamosa M (2007) An integrated cutting stock and sequencing problem. Eur J Oper Res 183–3:1353–1370

    Article  Google Scholar 

  • Yanasse H, Senne E (2010) The minimization of open stacks problem: a review of some properties and their use in pre-processing operations. Eur J Oper Res 203:559–567

    Article  MATH  Google Scholar 

Download references

Acknowledgments

We would like to thank the anonymous reviewers for their insightful and thorough comments, which greatly helped to improve this manuscript.

Author information

Authors and Affiliations

  1. Computer Science Department, FCEyN, University of Buenos Aires, Int. Güiraldes y Av. Cantilo, Pabellón I, 1428 , Ciudad de Buenos Aires, Argentina

    Silvina Lucero, Javier Marenco & Federico Martínez

Authors
  1. Silvina Lucero
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Javier Marenco
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Federico Martínez
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Javier Marenco.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lucero, S., Marenco, J. & Martínez, F. An integer programming approach for the 2-schemes strip cutting problem with a sequencing constraint. Optim Eng 16, 605–632 (2015). https://doi.org/10.1007/s11081-014-9264-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11081-014-9264-8

Keywords

Search

Navigation