IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v66y2015i8p1297-1311.html
   My bibliography  Save this article

A heuristic for the Minimum Score Separation Problem, a combinatorial problem associated with the cutting stock problem

Author

Listed:
  • Kai Helge Becker

    (Queensland University of Technology (QUT), Brisbane, Australia)

  • Gautam Appa

    (London School of Economics and Political Science, London, UK)

Abstract

The Minimum Score Separation Problem (MSSP) is a combinatorial problem that was introduced in JORS 55 as an open problem in the paper industry arising in conjunction with the cutting stock problem. During the process of producing boxes, flat papers are prepared for folding by being scored with knives. The problem is to determine whether and how a given production pattern of boxes can be arranged such that a certain minimum distance between the knives can be kept. Introducing the concept of matching-based alternating Hamiltonian paths, this paper models the MSSP as the problem of finding an alternating Hamiltonian path on a graph that is the union of a matching and a type of graph known as a ‘threshold graph’. On this basis, we find a heuristic that can quickly recognize a large percentage of feasible and infeasible instances of the MSSP. Detailed computational experiments demonstrate the efficiency of our approach.

Suggested Citation

  • Kai Helge Becker & Gautam Appa, 2015. "A heuristic for the Minimum Score Separation Problem, a combinatorial problem associated with the cutting stock problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(8), pages 1297-1311, August.
    • Handle: RePEc:pal:jorsoc:v:66:y:2015:i:8:p:1297-1311
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v66/n8/pdf/jors201487a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v66/n8/full/jors201487a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    Citations

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


    Cited by:

    1. Hawa, Asyl L. & Lewis, Rhyd & Thompson, Jonathan M., 2022. "Exact and approximate methods for the score-constrained packing problem," European Journal of Operational Research, Elsevier, vol. 302(3), pages 847-859.
    2. Yaodong Cui & Xiang Song & Yan Chen & Yi-Ping Cui, 2017. "New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftovers," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(3), pages 269-280, March.

    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:pal:jorsoc:v:66:y:2015:i:8:p:1297-1311. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.