IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v39y2011i6p627-633.html
   My bibliography  Save this article

A column generation heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint

Author

Listed:
  • Tempelmeier, Horst

Abstract

This paper deals with the dynamic multi-item capacitated lot-sizing problem under random period demands (SCLSP). Unfilled demands are backordered and a fill rate constraint is in effect. It is assumed that, according to the static-uncertainty strategy of Bookbinder and Tan [1], all decisions concerning the time and the production quantities are made in advance for the entire planning horizon regardless of the realization of the demands. The problem is approximated with the set partitioning model and a heuristic solution procedure that combines column generation and the recently developed ABC[beta] heuristic is proposed.

Suggested Citation

  • Tempelmeier, Horst, 2011. "A column generation heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint," Omega, Elsevier, vol. 39(6), pages 627-633, December.
    • Handle: RePEc:eee:jomega:v:39:y:2011:i:6:p:627-633
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(11)00006-5
    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. Wijngaard, J. & Wortmann, J. C., 1985. "MRP and inventories," European Journal of Operational Research, Elsevier, vol. 20(3), pages 281-293, June.
    2. Silver, Edward A. & Bischak, Diane P., 2011. "The exact fill rate in a periodic review base stock system under normally distributed demand," Omega, Elsevier, vol. 39(3), pages 346-349, June.
    3. Robinson, Powell & Narayanan, Arunachalam & Sahin, Funda, 2009. "Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms," Omega, Elsevier, vol. 37(1), pages 3-15, February.
    4. Sox, Charles R. & Jackson, Peter L. & Bowman, Alan & Muckstadt, John A., 1999. "A review of the stochastic lot scheduling problem," International Journal of Production Economics, Elsevier, vol. 62(3), pages 181-200, September.
    5. James H. Bookbinder & Jin-Yan Tan, 1988. "Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints," Management Science, INFORMS, vol. 34(9), pages 1096-1108, September.
    6. Cattrysse, Dirk & Maes, Johan & Van Wassenhove, Luk N., 1990. "Set partitioning and column generation heuristics for capacitated dynamic lotsizing," European Journal of Operational Research, Elsevier, vol. 46(1), pages 38-47, May.
    7. L. S. Lasdon & R. C. Terjung, 1971. "An Efficient Algorithm for Multi-Item Scheduling," Operations Research, INFORMS, vol. 19(4), pages 946-969, August.
    8. Martel, Alain & Diaby, Moustapha & Boctor, Fayez, 1995. "Multiple items procurement under stochastic nonstationary demands," European Journal of Operational Research, Elsevier, vol. 87(1), pages 74-92, November.
    9. Tunc, Huseyin & Kilic, Onur A. & Tarim, S. Armagan & Eksioglu, Burak, 2011. "The cost of using stationary inventory policies when demand is non-stationary," Omega, Elsevier, vol. 39(4), pages 410-415, August.
    10. Alan S. Manne, 1958. "Programming of Economic Lot Sizes," Management Science, INFORMS, vol. 4(2), pages 115-135, January.
    11. Unknown, 1986. "Letters," Choices: The Magazine of Food, Farm, and Resource Issues, Agricultural and Applied Economics Association, vol. 1(4), pages 1-9.
    12. Karimi, B. & Fatemi Ghomi, S. M. T. & Wilson, J. M., 2003. "The capacitated lot sizing problem: a review of models and algorithms," Omega, Elsevier, vol. 31(5), pages 365-378, October.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    3. Tempelmeier, Horst & Herpers, Sascha, 2011. "Dynamic uncapacitated lot sizing with random demand under a fillrate constraint," European Journal of Operational Research, Elsevier, vol. 212(3), pages 497-507, August.
    4. Tao Wu & Zhe Liang & Canrong Zhang, 2018. "Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 236-258, May.
    5. Azaron, Amir & Tang, Ou & Tavakkoli-Moghaddam, Reza, 2009. "Dynamic lot sizing problem with continuous-time Markovian production cost," International Journal of Production Economics, Elsevier, vol. 120(2), pages 607-612, August.
    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. 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.
    8. Gruson, Matthieu & Cordeau, Jean-François & Jans, Raf, 2018. "The impact of service level constraints in deterministic lot sizing with backlogging," Omega, Elsevier, vol. 79(C), pages 91-103.
    9. 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.
    10. Tiacci, Lorenzo & Saetta, Stefano, 2009. "An approach to evaluate the impact of interaction between demand forecasting method and stock control policy on the inventory system performances," International Journal of Production Economics, Elsevier, vol. 118(1), pages 63-71, March.
    11. Koca, Esra & Yaman, Hande & Selim Aktürk, M., 2015. "Stochastic lot sizing problem with controllable processing times," Omega, Elsevier, vol. 53(C), pages 1-10.
    12. Sereshti, Narges & Adulyasak, Yossiri & Jans, Raf, 2024. "Managing flexibility in stochastic multi-level lot sizing problem with service level constraints," Omega, Elsevier, vol. 122(C).
    13. Özen, Ulaş & Doğru, Mustafa K. & Armagan Tarim, S., 2012. "Static-dynamic uncertainty strategy for a single-item stochastic inventory control problem," Omega, Elsevier, vol. 40(3), pages 348-357.
    14. Simon Emde, 2017. "Scheduling the replenishment of just-in-time supermarkets in assembly plants," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 321-345, January.
    15. 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.
    16. Pauls-Worm, Karin G.J. & Hendrix, Eligius M.T. & Alcoba, Alejandro G. & Haijema, René, 2016. "Order quantities for perishable inventory control with non-stationary demand and a fill rate constraint," International Journal of Production Economics, Elsevier, vol. 181(PA), pages 238-246.
    17. Dellaert, N. P. & Melo, M. T., 1996. "Production strategies for a stochastic lot-sizing problem with constant capacity," European Journal of Operational Research, Elsevier, vol. 92(2), pages 281-301, July.
    18. 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.
    19. 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.
    20. Nasr, Walid W. & Elshar, Ibrahim J., 2018. "Continuous inventory control with stochastic and non-stationary Markovian demand," European Journal of Operational Research, Elsevier, vol. 270(1), pages 198-217.

    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:jomega:v:39:y:2011:i:6:p:627-633. 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/wps/find/journaldescription.cws_home/375/description#description .

    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.