IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v30-31y1993ip137-152.html
   My bibliography  Save this article

Capacitated lot-sizing with minimum batch sizes and setup times

Author

Listed:
  • Anderson, Edward J.
  • Cheah, Boon Soon

Abstract

No abstract is available for this item.

Suggested Citation

  • Anderson, Edward J. & Cheah, Boon Soon, 1993. "Capacitated lot-sizing with minimum batch sizes and setup times," International Journal of Production Economics, Elsevier, vol. 30(1), pages 137-152, July.
    • Handle: RePEc:eee:proeco:v:30-31:y:1993:i::p:137-152
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0925-5273(93)90087-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Bouchriha, Hanen & Ouhimmou, Mustapha & D'Amours, Sophie, 2007. "Lot sizing problem on a paper machine under a cyclic production approach," International Journal of Production Economics, Elsevier, vol. 105(2), pages 318-328, February.
    2. Jans, R.F. & Degraeve, Z., 2005. "Modeling Industrial Lot Sizing Problems: A Review," ERIM Report Series Research in Management ERS-2005-049-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    3. Okhrin, Irena & Richter, Knut, 2011. "An O(T3) algorithm for the capacitated lot sizing problem with minimum order quantities," European Journal of Operational Research, Elsevier, vol. 211(3), pages 507-514, June.
    4. Aghezzaf, El-Houssaine, 2000. "Lot-sizing problem with setup times in labor-based capacity production systems," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 1-9, March.
    5. Hellion, Bertrand & Mangione, Fabien & Penz, Bernard, 2012. "A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs," European Journal of Operational Research, Elsevier, vol. 222(1), pages 10-16.
    6. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    7. Okhrin, Irena & Richter, Knut, 2011. "The linear dynamic lot size problem with minimum order quantity," International Journal of Production Economics, Elsevier, vol. 133(2), pages 688-693, October.
    8. Stadtler, Hartmut, 1996. "Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing," European Journal of Operational Research, Elsevier, vol. 94(3), pages 561-581, November.
    9. Muriel, Ana & Chugh, Tammana & Prokle, Michael, 2022. "Efficient algorithms for the joint replenishment problem with minimum order quantities," European Journal of Operational Research, Elsevier, vol. 300(1), pages 137-150.
    10. Mohan Gopalakrishnan & Ke Ding & Jean-Marie Bourjolly & Srimathy Mohan, 2001. "A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover," Management Science, INFORMS, vol. 47(6), pages 851-863, June.

    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:eee:proeco:v:30-31:y:1993:i::p:137-152. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.