IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v95y2005i2p179-193.html
   My bibliography  Save this article

An optimal algorithm for solving the dynamic lot-sizing model with learning and forgetting in setups and production

Author

Listed:
  • Chiu, Huan Neng
  • Chen, Hsin Min

Abstract

No abstract is available for this item.

Suggested Citation

  • Chiu, Huan Neng & Chen, Hsin Min, 2005. "An optimal algorithm for solving the dynamic lot-sizing model with learning and forgetting in setups and production," International Journal of Production Economics, Elsevier, vol. 95(2), pages 179-193, February.
    • Handle: RePEc:eee:proeco:v:95:y:2005:i:2:p:179-193
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(03)00386-4
    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.

    References listed on IDEAS

    as
    1. Jaber, Mohamad Y. & Bonney, Maurice, 2001. "Economic lot sizing with learning and continuous time discounting: Is it significant?," International Journal of Production Economics, Elsevier, vol. 71(1-3), pages 135-143, May.
    2. Michal Tzur, 1996. "Learning in Setups: Analysis, Minimal Forecast Horizons, and Algorithms," Management Science, INFORMS, vol. 42(12), pages 1732-1743, December.
    3. Jaber, Mohamad Y. & Bonney, Maurice, 1999. "The economic manufacture/order quantity (EMQ/EOQ) and the learning curve: Past, present, and future," International Journal of Production Economics, Elsevier, vol. 59(1-3), pages 93-102, March.
    4. Jaber, Mohamad Y. & Bonney, Maurice, 1997. "The effect of learning and forgetting on the economic manufactured quantity (EMQ) with the consideration of intracycle backorders," International Journal of Production Economics, Elsevier, vol. 53(1), pages 1-11, November.
    5. Harvey M. Wagner & Thomson M. Whitin, 1958. "Dynamic Version of the Economic Lot Size Model," Management Science, INFORMS, vol. 5(1), pages 89-96, October.
    6. E. C. Keachie & Robert J. Fontana, 1966. "Effects of Learning on Optimal Lot Size," Management Science, INFORMS, vol. 13(2), pages 102-108, October.
    7. Suresh Chand & Suresh P. Sethi, 1990. "A Dynamic Lot Sizing Model with Learning in Setups," Operations Research, INFORMS, vol. 38(4), pages 644-655, August.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Motla, Ritu & Kumar, Ashok & Saxena, Neha & Sana, Shib Sankar, 2023. "Inventory optimization in a green environment with two warehouses," Innovation and Green Development, Elsevier, vol. 2(4).
    2. Jaber, Mohamad Y. & Bonney, Maurice & Guiffrida, Alfred L., 2010. "Coordinating a three-level supply chain with learning-based continuous improvement," International Journal of Production Economics, Elsevier, vol. 127(1), pages 27-38, September.
    3. Jaber, Mohamad Y. & El Saadany, Ahmed M.A., 2011. "An economic production and remanufacturing model with learning effects," International Journal of Production Economics, Elsevier, vol. 131(1), pages 115-127, May.
    4. Khan, M. & Jaber, M.Y. & Wahab, M.I.M., 2010. "Economic order quantity model for items with imperfect quality with learning in inspection," International Journal of Production Economics, Elsevier, vol. 124(1), pages 87-96, March.
    5. Wang, J.-B. & Ng, C.T. & Cheng, T.C.E. & Liu, L.L., 2008. "Single-machine scheduling with a time-dependent learning effect," International Journal of Production Economics, Elsevier, vol. 111(2), pages 802-811, February.
    6. Sunantha Teyarachakul & Suresh Chand & Michal Tzur, 2016. "Lot sizing with learning and forgetting in setups: Analytical results and insights," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(2), pages 93-108, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Vernon Ning Hsu, 2000. "Dynamic Economic Lot Size Model with Perishable Inventory," Management Science, INFORMS, vol. 46(8), pages 1159-1169, August.
    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. Mazzola, Joseph B. & Neebe, Alan W. & Rump, Christopher M., 1998. "Multiproduct production planning in the presence of work-force learning," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 336-356, April.
    4. Feng Xue & Qiumin Li, 2024. "Forecast Horizon of Dynamic Lot Sizing Problem with Perishable Inventory and Multiple Chain Stores: Shipping and Stockout Cost," Mathematics, MDPI, vol. 12(13), pages 1-17, July.
    5. Chung-Lun Li & Vernon Ning Hsu & Wen-Qiang Xiao, 2004. "Dynamic Lot Sizing with Batch Ordering and Truckload Discounts," Operations Research, INFORMS, vol. 52(4), pages 639-654, August.
    6. Hoesel, C. P. M. Van & Wagelmans, A. P. M., 2000. "Parametric analysis of setup cost in the economic lot-sizing model without speculative motives," International Journal of Production Economics, Elsevier, vol. 66(1), pages 13-22, June.
    7. Trappey, Amy J.C. & Trappey, Charles V. & Liu, Penny H.Y. & Lin, Lee-Cheng & Ou, Jerry J.R., 2013. "A hierarchical cost learning model for developing wind energy infrastructures," International Journal of Production Economics, Elsevier, vol. 146(2), pages 386-391.
    8. Chen, Cheng-Kang & Lo, Chih-Chung & Liao, Yi-Xiang, 2008. "Optimal lot size with learning consideration on an imperfect production system with allowable shortages," International Journal of Production Economics, Elsevier, vol. 113(1), pages 459-469, May.
    9. Diaby, Moustapha, 1995. "Optimal setup time reduction for a single product with dynamic demands," European Journal of Operational Research, Elsevier, vol. 85(3), pages 532-540, September.
    10. Suresh Chand & Vernon Ning Hsu & Suresh Sethi, 2002. "Forecast, Solution, and Rolling Horizons in Operations Management Problems: A Classified Bibliography," Manufacturing & Service Operations Management, INFORMS, vol. 4(1), pages 25-43, September.
    11. Fuying Jing & Zirui Lan, 2017. "Forecast horizon of multi-item dynamic lot size model with perishable inventory," PLOS ONE, Public Library of Science, vol. 12(11), pages 1-15, November.
    12. Jaber, Mohamad Y. & Bonney, Maurice, 2007. "Economic manufacture quantity (EMQ) model with lot-size dependent learning and forgetting rates," International Journal of Production Economics, Elsevier, vol. 108(1-2), pages 359-367, July.
    13. Sunantha Teyarachakul & Suresh Chand & Michal Tzur, 2016. "Lot sizing with learning and forgetting in setups: Analytical results and insights," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(2), pages 93-108, March.
    14. Awi Federgruen & Michal Tzur, 1996. "Detection of minimal forecast horizons in dynamic programs with multiple indicators of the future," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(2), pages 169-189, March.
    15. Jaber, Mohamad Y. & El Saadany, Ahmed M.A., 2011. "An economic production and remanufacturing model with learning effects," International Journal of Production Economics, Elsevier, vol. 131(1), pages 115-127, May.
    16. Battini, Daria & Persona, Alessandro & Sgarbossa, Fabio, 2014. "A sustainable EOQ model: Theoretical formulation and applications," International Journal of Production Economics, Elsevier, vol. 149(C), pages 145-153.
    17. Siao-Leu Phouratsamay & Safia Kedad-Sidhoum & Fanny Pascual, 2021. "Coordination of a two-level supply chain with contracts," 4OR, Springer, vol. 19(2), pages 235-264, June.
    18. Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.
    19. Charles, Mehdi & Dauzère-Pérès, Stéphane & Kedad-Sidhoum, Safia & Mazhoud, Issam, 2022. "Motivations and analysis of the capacitated lot-sizing problem with setup times and minimum and maximum ending inventories," European Journal of Operational Research, Elsevier, vol. 302(1), pages 203-220.
    20. Minjiao Zhang & Simge Küçükyavuz & Saumya Goel, 2014. "A Branch-and-Cut Method for Dynamic Decision Making Under Joint Chance Constraints," Management Science, INFORMS, vol. 60(5), pages 1317-1333, May.

    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:95:y:2005:i:2:p:179-193. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.