IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v34y1987i1p67-86.html
   My bibliography  Save this article

Algorithms and heuristics for variable‐yield lot sizing

Author

Listed:
  • Joseph B. Mazzola
  • William F. McCoy
  • Harvey M. Wagner

Abstract

We consider the multiperiod lot‐sizing problem in which the production yield (the proportion of usable goods) is variable according to a known probability distribution. We review two economic order quantity (EOQ) models for the stationary demand continuous‐time problem and derive an EOQ model when the production yield follows a binomial distribution and backlogging of demand is permitted. A dynamic programming algorithm for an arbitrary sequence of demand requirements is presented. Heuristics based on both the EOQ model and appropriate modification of the underlying perfect‐yield lot‐sizing policies are discussed, and extensive computational evaluation of these heuristics is presented. Two of these heuristics are then modified to include the notion of supply safety stock. The modified heuristics consistently produce near‐optimal lot‐sizing policies for problems with stationary and time‐varying demands.

Suggested Citation

  • Joseph B. Mazzola & William F. McCoy & Harvey M. Wagner, 1987. "Algorithms and heuristics for variable‐yield lot sizing," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(1), pages 67-86, February.
  • Handle: RePEc:wly:navres:v:34:y:1987:i:1:p:67-86
    DOI: 10.1002/1520-6750(198702)34:13.0.CO;2-R
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(198702)34:13.0.CO;2-R
    Download Restriction: no

    File URL: https://libkey.io/10.1002/1520-6750(198702)34:13.0.CO;2-R?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
    ---><---

    References listed on IDEAS

    as
    1. B. D. Sivazlian, 1974. "A Continous-Review ( s , S ) Inventory System with Arbitrary Interarrival Distribution between Unit Demand," Operations Research, INFORMS, vol. 22(1), pages 65-71, February.
    2. Martin Beckmann, 1961. "An Inventory Model for Arbitrary Interval and Quantity Distributions of Demand," Management Science, INFORMS, vol. 8(1), pages 35-57, October.
    3. Alan C. Wheeler, 1972. "Stationary (s, s) policies for a finite horizon," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 19(4), pages 601-619, December.
    4. Blyth C. Archibald & Edward A. Silver, 1978. "(s, S) Policies Under Continuous Review and Discrete Compound Poisson Demand," Management Science, INFORMS, vol. 24(9), pages 899-909, May.
    5. Paul R. Beesack, 1967. "A Finite Horizon Dynamic Inventory Model with a Stockout Constraint," Management Science, INFORMS, vol. 13(9), pages 618-630, May.
    6. Michael Florian & Morton Klein, 1971. "Deterministic Production Planning with Concave Costs and Capacity Constraints," Management Science, INFORMS, vol. 18(1), pages 12-20, September.
    7. C. Roger Glassey, 1971. "Dynamic Linear Programs for Production Scheduling," Operations Research, INFORMS, vol. 19(1), pages 45-56, February.
    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. Barιş Ata & Deishin Lee & Erkut Sönmez, 2019. "Dynamic Volunteer Staffing in Multicrop Gleaning Operations," Operations Research, INFORMS, vol. 67(2), pages 295-314, March.
    2. Bardia Kamrad & Keith Ord, 2006. "Market risk and process uncertainty in production operations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(7), pages 627-640, October.
    3. Yigal Gerchak & Mahmut Parlar, 1990. "Yield randomness, cost tradeoffs, and diversification in the EOQ model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(3), pages 341-354, June.
    4. Gel, Esma S. & Salman, F. Sibel, 2022. "Dynamic ordering decisions with approximate learning of supply yield uncertainty," International Journal of Production Economics, Elsevier, vol. 243(C).

    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. Sandun C. Perera & Suresh P. Sethi, 2023. "A survey of stochastic inventory models with fixed costs: Optimality of (s, S) and (s, S)‐type policies—Continuous‐time case," Production and Operations Management, Production and Operations Management Society, vol. 32(1), pages 154-169, January.
    2. Frenk, J.B.G. & Kleijn, M.J., 1997. "On regenerative processes and inventory control," Econometric Institute Research Papers EI 9741/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    3. Kaj Rosling, 2002. "Inventory Cost Rate Functions with Nonlinear Shortage Costs," Operations Research, INFORMS, vol. 50(6), pages 1007-1017, December.
    4. Chew, Ek Peng & Tang, Loon Ching, 1995. "Warehouse-retailer system with stochastic demands -- Non-identical retailer case," European Journal of Operational Research, Elsevier, vol. 82(1), pages 98-110, April.
    5. Fernando Alvarez & Francesco Lippi & Roberto Robatto, 2019. "Cost of Inflation in Inventory Theoretical Models," Review of Economic Dynamics, Elsevier for the Society for Economic Dynamics, vol. 32, pages 206-226, April.
    6. Ming Zhao & Minjiao Zhang, 2020. "Multiechelon Lot Sizing: New Complexities and Inequalities," Operations Research, INFORMS, vol. 68(2), pages 534-551, March.
    7. Li Chen & Hau L. Lee, 2012. "Bullwhip Effect Measurement and Its Implications," Operations Research, INFORMS, vol. 60(4), pages 771-784, August.
    8. 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.
    9. Awi Federgruen & Joern Meissner & Michal Tzur, 2007. "Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems," Operations Research, INFORMS, vol. 55(3), pages 490-502, June.
    10. Cortés, Pablo & Muñuzuri, Jesús & Guadix, José & Onieva, Luis, 2013. "Optimal algorithm for the demand routing problem in multicommodity flow distribution networks with diversification constraints and concave costs," International Journal of Production Economics, Elsevier, vol. 146(1), pages 313-324.
    11. Karla E. Bourland & Candace Arai Yano, 1996. "Lot sizing when yields increase during the production run," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(8), pages 1035-1047, December.
    12. Atamturk, Alper & Munoz, Juan Carlos, 2002. "A Study of the Lot-Sizing Polytope," University of California Transportation Center, Working Papers qt6zz2g0z4, University of California Transportation Center.
    13. Prak, Dennis & Teunter, Ruud & Babai, Mohamed Zied & Boylan, John E. & Syntetos, Aris, 2021. "Robust compound Poisson parameter estimation for inventory control," Omega, Elsevier, vol. 104(C).
    14. Rademeyer, Maryke C. & Minnitt, Richard C.A. & Falcon, Rosemary M.S., 2018. "Revisiting operating cost in resource extraction industries," Resources Policy, Elsevier, vol. 58(C), pages 159-164.
    15. van Hoesel, C.P.M. & Wagelmans, A., 1997. "Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems," Research Memorandum 029, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    16. Yongpei Guan, 2011. "Stochastic lot-sizing with backlogging: computational complexity analysis," Journal of Global Optimization, Springer, vol. 49(4), pages 651-678, April.
    17. Roni, Mohammad S. & Jin, Mingzhou & Eksioglu, Sandra D., 2015. "A hybrid inventory management system responding to regular demand and surge demand," Omega, Elsevier, vol. 52(C), pages 190-200.
    18. Babai, M.Z. & Jemai, Z. & Dallery, Y., 2011. "Analysis of order-up-to-level inventory systems with compound Poisson demand," European Journal of Operational Research, Elsevier, vol. 210(3), pages 552-558, May.
    19. Prak, Derk & Teunter, Rudolf & Babai, M. Z. & Syntetos, A. A. & Boylan, D, 2018. "Forecasting and Inventory Control with Compound Poisson Demand Using Periodic Demand Data," Research Report 2018010, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    20. Izzet Sahin & Diptendu Sinha, 1987. "Renewal approximation to optimal order quantity for a class of continuous‐review inventory systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(5), pages 655-667, October.

    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:wly:navres:v:34:y:1987:i:1:p:67-86. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.