IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v54y2016i14p4327-4339.html
   My bibliography  Save this article

An algorithm for a cutting problem in window frame production

Author

Listed:
  • Byung-In Kim
  • Youngmin Ki
  • Donghee Son
  • Byungjoo Bae
  • Jun-Seo Park

Abstract

This research discusses the cutting problem encountered by a real-life window frame manufacturer. In the problem, four types of bars (upper, bottom, left and right) should be cut from raw material aluminium profiles for each window frame order. These bars must be cut such that trim loss is minimised. Moreover, the bars should be assigned to the same raw material profile if possible to increase productivity; otherwise, they should be assigned to neighbouring raw material profiles. Furthermore, the numbers of bar types as derived from a raw material profile should not be unbalanced because this scenario induces subsequent machine load imbalance. In this study, we develop a mixed integer programming model and a knapsack-based heuristic approach that minimises the weighted sum of trim loss, bar type imbalance and the degree of order spreading. The results of computational experiments demonstrate the effectiveness of the proposed algorithm, and the proposed approach outperforms the legacy system of the company. Thus, this method is currently being used by the firm in question.

Suggested Citation

  • Byung-In Kim & Youngmin Ki & Donghee Son & Byungjoo Bae & Jun-Seo Park, 2016. "An algorithm for a cutting problem in window frame production," International Journal of Production Research, Taylor & Francis Journals, vol. 54(14), pages 4327-4339, July.
    • Handle: RePEc:taf:tprsxx:v:54:y:2016:i:14:p:4327-4339
    DOI: 10.1080/00207543.2016.1148279
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2016.1148279
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2016.1148279?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.

    Citations

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


    Cited by:

    1. 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.

    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:taf:tprsxx:v:54:y:2016:i:14:p:4327-4339. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.