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

A Markovian approach for multi-level multi-product multi-period capacitated lot-sizing problem with uncertainty in levels

Author

Listed:
  • J. Behnamian
  • S.M.T. Fatemi Ghomi
  • B. Karimi
  • M. Fadaei Moludi

Abstract

This paper considers a multi-level, multi-item, multi-period capacitated lot-sizing problem with sequence-dependent family set-up times, set-up carry over and uncertainty in levels due to uncertainty in inspection, rework and scrap. In this study, we, first, determined total processing time for each product of each family. Then, expected number of times associated with visiting each level of each product as well as amount of raw materials are calculated. We developed a mixed integer linear programming model with a numerical example and sensitivity analysis.

Suggested Citation

  • J. Behnamian & S.M.T. Fatemi Ghomi & B. Karimi & M. Fadaei Moludi, 2017. "A Markovian approach for multi-level multi-product multi-period capacitated lot-sizing problem with uncertainty in levels," International Journal of Production Research, Taylor & Francis Journals, vol. 55(18), pages 5330-5340, September.
    • Handle: RePEc:taf:tprsxx:v:55:y:2017:i:18:p:5330-5340
    DOI: 10.1080/00207543.2017.1311048
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2017.1311048
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2017.1311048?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. Li, Yuchen & Liu, Ming & Saldanha-da-Gama, Francisco & Yang, Zaoli, 2024. "Risk-averse two-stage stochastic programming for assembly line reconfiguration with dynamic lot sizes," Omega, Elsevier, vol. 127(C).
    2. Li, Yuchen & Saldanha-da-Gama, Francisco & Liu, Ming & Yang, Zaoli, 2023. "A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem," European Journal of Operational Research, Elsevier, vol. 304(1), pages 353-365.

    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:55:y:2017:i:18:p:5330-5340. 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.