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

Impact analysis of setup carryover and crossover on lot sizing problems

Author

Listed:
  • Diego Jacinto Fiorotto
  • Jackeline del Carmen Huaccha Neyra
  • Silvio Alexandre de Araujo

Abstract

This paper presents a literature classification and a detailed computational study analysing the impact of considering the possibility of setup carryover and crossover when solving the lot sizing problem. This problem is an extension of the standard Capacitated Lot Sizing Problem. A setup carryover is defined as the possibility to begin a period with production (instead of setup) of the item that was being produced at the end of the previous period. A setup crossover allows the opportunity to start a setup operation in one period and continue it to the following one, i.e. the setup operation can span over two periods. We adapt and compare two formulations proposed in the literature that have not been compared each other. Furthermore, some formulations proposed in the literature for modelling the setup crossover with a reduced number of binary variables, are extended to the addressed problem. Finally, a relax-and-fix and fix-and-optimise (RF-FO) heuristic is also applied to solve some difficult instances. Computational results are presented based on random generated data.

Suggested Citation

  • Diego Jacinto Fiorotto & Jackeline del Carmen Huaccha Neyra & Silvio Alexandre de Araujo, 2020. "Impact analysis of setup carryover and crossover on lot sizing problems," International Journal of Production Research, Taylor & Francis Journals, vol. 58(20), pages 6350-6369, October.
    • Handle: RePEc:taf:tprsxx:v:58:y:2020:i:20:p:6350-6369
    DOI: 10.1080/00207543.2019.1680892
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2019.1680892
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2019.1680892?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. Lee, Younsoo & Lee, Kyungsik, 2022. "New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups," European Journal of Operational Research, Elsevier, vol. 302(1), pages 230-243.

    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:58:y:2020:i:20:p:6350-6369. 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.