IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v18y1972i9p508-517.html
   My bibliography  Save this article

Optimization of Batch Ordering under Deterministic Variable Demand

Author

Listed:
  • Salah E. Elmaghraby

    (North Carolina State University)

  • Vishwas Y. Bawle

    (American Natural Gas Service Company, Detroit, Michigan)

Abstract

We consider the problem of the optimal ordering schedule to satisfy a given demand pattern over a finite planning horizon when ordering must be in batches of size Q > 1, with and without "setup" cost. A dynamic programming model is constructed. The number of stages are minimized through the characterization of a "complete" set of periods in which ordering must take place and through consideration of the role of initial inventory. The state space and the decision space at each stage are also minimized through considerations of dominance, bounding and feasibility relative to established properties of the optimal schedule. All this results in a most computational efficient algorithm.

Suggested Citation

  • Salah E. Elmaghraby & Vishwas Y. Bawle, 1972. "Optimization of Batch Ordering under Deterministic Variable Demand," Management Science, INFORMS, vol. 18(9), pages 508-517, May.
    • Handle: RePEc:inm:ormnsc:v:18:y:1972:i:9:p:508-517
    DOI: 10.1287/mnsc.18.9.508
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.18.9.508
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.18.9.508?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
    ---><---

    Citations

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


    Cited by:

    1. Petering, Matthew E.H. & Chen, Xi & Hsieh, Wen-Huan, 2019. "Inventory control with flexible demand: Cyclic case with multiple batch supply and demand processes," International Journal of Production Economics, Elsevier, vol. 212(C), pages 60-77.
    2. 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.
    3. 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.
    4. Jing, Fuying & Chao, Xiangrui, 2022. "Forecast horizons for a two-echelon dynamic lot-sizing problem," Omega, Elsevier, vol. 110(C).
    5. 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.

    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:inm:ormnsc:v:18:y:1972:i:9:p:508-517. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.