IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v3y1957i3p279-284.html
   My bibliography  Save this article

The Trim Problem

Author

Listed:
  • Kurt Eisemann

    (IBM Corp.)

Abstract

A problem of primary significance to a variety of industries is the suppression of trim losses in cutting rolls of paper, textiles, cellophane, metallic foil, or other material, for the execution of business orders. This problem is amenable to solution by the application of mathematical tools. We shall illustrate the general treatment of such problems by demonstrating a numerical example.

Suggested Citation

  • Kurt Eisemann, 1957. "The Trim Problem," Management Science, INFORMS, vol. 3(3), pages 279-284, April.
    • Handle: RePEc:inm:ormnsc:v:3:y:1957:i:3:p:279-284
    DOI: 10.1287/mnsc.3.3.279
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.3.3.279
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.3.3.279?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
    ---><---

    Citations

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


    Cited by:

    1. Sören Koch & Sebastian König & Gerhard Wäscher, 2008. "Linear Programming for a Cutting Problem in the Wood Processing Industry – A Case Study," FEMM Working Papers 08014, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    2. Sierra-Paradinas, María & Soto-Sánchez, Óscar & Alonso-Ayuso, Antonio & Martín-Campo, F. Javier & Gallego, Micael, 2021. "An exact model for a slitting problem in the steel industry," European Journal of Operational Research, Elsevier, vol. 295(1), pages 336-347.
    3. Maimon, Oded & Dayagi, Arie, 1995. "Nesting planning based on production priorities and technological efficiency," European Journal of Operational Research, Elsevier, vol. 80(1), pages 121-129, January.
    4. Klaus Jansen & Roberto Solis-Oba, 2011. "A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 743-753, November.
    5. 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.
    6. Minghui Zhang & Xin Han & Yan Lan & Hing-Fung Ting, 2017. "Online bin packing problem with buffer and bounded size revisited," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 530-542, February.
    7. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.

    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:inm:ormnsc:v:3:y:1957:i:3:p:279-284. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.