IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v122y2000i2p339-353.html
   My bibliography  Save this article

A novel decomposition approach for on-line lot-sizing

Author

Listed:
  • Aarts, E. H. L.
  • Reijnhoudt, M. F.
  • Stehouwer, H. P.
  • Wessels, J.

Abstract

No abstract is available for this item.

Suggested Citation

  • Aarts, E. H. L. & Reijnhoudt, M. F. & Stehouwer, H. P. & Wessels, J., 2000. "A novel decomposition approach for on-line lot-sizing," European Journal of Operational Research, Elsevier, vol. 122(2), pages 339-353, April.
    • Handle: RePEc:eee:ejores:v:122:y:2000:i:2:p:339-353
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00237-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. 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.
    2. R. Jagannathan & M. R. Rao, 1973. "A Class of Deterministic Production Planning Problems," Management Science, INFORMS, vol. 19(11), pages 1295-1300, July.
    3. Rolf A. Lundin & Thomas E. Morton, 1975. "Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results," Operations Research, INFORMS, vol. 23(4), pages 711-734, August.
    4. Alok Aggarwal & James K. Park, 1993. "Improved Algorithms for Economic Lot Size Problems," Operations Research, INFORMS, vol. 41(3), pages 549-571, June.
    5. Awi Federgruen & Michal Tzur, 1994. "Minimal Forecast Horizons and a New Planning Procedure for the General Dynamic Lot Sizing Model: Nervousness Revisited," Operations Research, INFORMS, vol. 42(3), pages 456-468, June.
    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. 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.
    2. Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, 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. Marshall Fisher & Kamalini Ramdas & Yu-Sheng Zheng, 2001. "Ending Inventory Valuation in Multiperiod Production Scheduling," Management Science, INFORMS, vol. 47(5), pages 679-692, May.
    2. Martel, Alain & Gascon, Andre, 1998. "Dynamic lot-sizing with price changes and price-dependent holding costs," European Journal of Operational Research, Elsevier, vol. 111(1), pages 114-128, November.
    3. 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.
    4. Milind Dawande & Srinagesh Gavirneni & Sanjeewa Naranpanawe & Suresh Sethi, 2007. "Forecast Horizons for a Class of Dynamic Lot-Size Problems Under Discrete Future Demand," Operations Research, INFORMS, vol. 55(4), pages 688-702, August.
    5. 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.
    6. Brahimi, Nadjib & Dauzere-Peres, Stephane & Najid, Najib M. & Nordli, Atle, 2006. "Single item lot sizing problems," European Journal of Operational Research, Elsevier, vol. 168(1), pages 1-16, January.
    7. 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.
    8. 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.
    9. 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.
    10. Stan van Hoesel & H. Edwin Romeijn & Dolores Romero Morales & Albert P. M. Wagelmans, 2005. "Integrated Lot Sizing in Serial Supply Chains with Production Capacities," Management Science, INFORMS, vol. 51(11), pages 1706-1719, November.
    11. Hark‐Chin Hwang & Wilco van den Heuvel, 2012. "Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 244-253, April.
    12. Herbert Meyr & Mirko Kiel, 2022. "Minimizing setups and waste when printing labels of consumer goods," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(3), pages 733-761, September.
    13. Nadjib Brahimi & Stéphane Dauzère-Pérès & Najib M. Najid, 2006. "Capacitated Multi-Item Lot-Sizing Problems with Time Windows," Operations Research, INFORMS, vol. 54(5), pages 951-967, October.
    14. Piñeyro, Pedro & Viera, Omar, 2010. "The economic lot-sizing problem with remanufacturing and one-way substitution," International Journal of Production Economics, Elsevier, vol. 124(2), pages 482-488, April.
    15. Hark-Chin Hwang, 2010. "Economic Lot-Sizing for Integrated Production and Transportation," Operations Research, INFORMS, vol. 58(2), pages 428-444, April.
    16. Chung-Lun Li & Qingying Li, 2016. "Polynomial-Time Solvability of Dynamic Lot Size Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-20, June.
    17. Hark-Chin Hwang & Hyun-Soo Ahn & Philip Kaminsky, 2013. "Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem," Operations Research, INFORMS, vol. 61(2), pages 469-482, April.
    18. Yale T. Herer & Michal Tzur, 2001. "The dynamic transshipment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(5), pages 386-408, August.
    19. Hark-Chin Hwang, 2009. "Inventory Replenishment and Inbound Shipment Scheduling Under a Minimum Replenishment Policy," Transportation Science, INFORMS, vol. 43(2), pages 244-264, May.
    20. Hark-Chin Hwang & Wilco van den Heuvel & Albert P. M. Wagelmans, 2023. "Multilevel Lot-Sizing with Inventory Bounds," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1470-1490, November.

    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:ejores:v:122:y:2000:i:2:p:339-353. 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/eor .

    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.