IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v50y2002i4p680-691.html
   My bibliography  Save this article

Product Cycling With Uncertain Yields: Analysis and Application to the Process Industry

Author

Listed:
  • Kumar Rajaram

    (Decision, Operations, and Technology Management, The Anderson School, University of California at Los Angeles, 110 Westwood Plaza, Los Angeles, California 90095--1481)

  • Uday S. Karmarkar

    (Decision, Operations, and Technology Management, The Anderson School, University of California at Los Angeles, 110 Westwood Plaza, Los Angeles, California 90095--1481)

Abstract

We formulate the dynamic product-cycling problem with yield uncertainty and buffer limits to determine how much product to produce at what time to minimize total expected switching, production, inventory storage, and backorder costs. A “restricted” Lagrangian technique is used to develop a lower bound and a model-based Lagrangian heuristic. We also develop an operational heuristic and a greedy heuristic. The operational heuristic has been implemented at seven refineries at Cerestar, Europe's leading manufacturer of wheat-and corn-based starch products in the food-processing industry . This has already reduced total costs by around 5 percent or $3 million annually at these sites. Tests of the Lagrangian heuristic on data from these refineries during this period have shown the potential to further reduce total costs by at least 2 percent or about $1 million. In addition, the Lagrangian heuristic has provided an objective basis to evaluate the economic impact of several strategic decisions involving issues such as buffer expansion, variability reduction, and product selection.

Suggested Citation

  • Kumar Rajaram & Uday S. Karmarkar, 2002. "Product Cycling With Uncertain Yields: Analysis and Application to the Process Industry," Operations Research, INFORMS, vol. 50(4), pages 680-691, August.
  • Handle: RePEc:inm:oropre:v:50:y:2002:i:4:p:680-691
    DOI: 10.1287/opre.50.4.680.2867
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.50.4.680.2867
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.50.4.680.2867?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. Salah E. Elmaghraby, 1978. "The Economic Lot Scheduling Problem (ELSP): Review and Extensions," Management Science, INFORMS, vol. 24(6), pages 587-598, February.
    2. Uday S. Karmarkar, 1987. "The Multilocation Multiperiod Inventory Problem: Bounds and Approximations," Management Science, INFORMS, vol. 33(1), pages 86-94, January.
    3. Uday S. Karmarkar & Linus Schrage, 1985. "The Deterministic Dynamic Product Cycling Problem," Operations Research, INFORMS, vol. 33(2), pages 326-345, April.
    4. Srinivas Bollapragada & Thomas E. Morton, 1999. "Myopic Heuristics for the Random Yield Problem," Operations Research, INFORMS, vol. 47(5), pages 713-722, October.
    5. Karmarkar, Uday S. & Yoo, Jinsung, 1994. "The stochastic dynamic product cycling problem," European Journal of Operational Research, Elsevier, vol. 73(2), pages 360-373, March.
    6. Yves Pochet & Laurence A. Wolsey, 1991. "Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes," Management Science, INFORMS, vol. 37(1), pages 53-67, January.
    7. Candace Arai Yano & Hau L. Lee, 1995. "Lot Sizing with Random Yields: A Review," Operations Research, INFORMS, vol. 43(2), pages 311-334, April.
    8. Fleischmann, Bernhard, 1990. "The discrete lot-sizing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 44(3), pages 337-348, 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. G. P. Kiesmüller & K. Inderfurth, 2018. "Approaches for periodic inventory control under random production yield and fixed setup cost," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(2), pages 449-477, March.
    2. Qing Li & Shaohui Zheng, 2006. "Joint Inventory Replenishment and Pricing Control for Systems with Uncertain Yield and Demand," Operations Research, INFORMS, vol. 54(4), pages 696-705, August.
    3. Tinglong Dai & Kinshuk Jerath, 2019. "Salesforce Contracting Under Uncertain Demand and Supply: Double Moral Hazard and Optimality of Smooth Contracts," Marketing Science, INFORMS, vol. 38(5), pages 852-870, September.
    4. Van Nieuwenhuyse, Inneke & Vandaele, Nico & Rajaram, Kumar & Karmarkar, Uday S., 2007. "Buffer sizing in multi-product multi-reactor batch processes: Impact of allocation and campaign sizing policies," European Journal of Operational Research, Elsevier, vol. 179(2), pages 424-443, June.
    5. Diwakar Gupta & William L. Cooper, 2005. "Stochastic Comparisons in Production Yield Management," Operations Research, INFORMS, vol. 53(2), pages 377-384, April.
    6. Rajaram, Kumar & Robotis, Andreas, 2004. "Analyzing variability in continuous processes," European Journal of Operational Research, Elsevier, vol. 156(2), pages 312-325, July.
    7. Burak Kazaz & Scott Webster, 2011. "The Impact of Yield-Dependent Trading Costs on Pricing and Production Planning Under Supply Uncertainty," Manufacturing & Service Operations Management, INFORMS, vol. 13(3), pages 404-417, July.
    8. Victor F. Araman & Ioana Popescu, 2010. "Media Revenue Management with Audience Uncertainty: Balancing Upfront and Spot Market Sales," Manufacturing & Service Operations Management, INFORMS, vol. 12(2), pages 190-212, December.
    9. Kumar Rajaram & Uday S. Karmarkar, 2004. "Campaign Planning and Scheduling for Multiproduct Batch Operations with Applications to the Food-Processing Industry," Manufacturing & Service Operations Management, INFORMS, vol. 6(3), pages 253-269, October.
    10. Zhong, Yuanguang & Liu, Ju & Zhou, Yong-Wu & Cao, Bin & Cheng, T.C. Edwin, 2022. "Robust contract design and coordination under consignment contracts with revenue sharing," International Journal of Production Economics, Elsevier, vol. 253(C).
    11. Kaijie Zhu & Rachel Q. Zhang & Fugee Tsung, 2007. "Pushing Quality Improvement Along Supply Chains," Management Science, INFORMS, vol. 53(3), pages 421-436, March.
    12. Felipe Caro & Kumar Rajaram & Jens Wollenweber, 2012. "Process Location and Product Distribution with Uncertain Yields," Operations Research, INFORMS, vol. 60(5), pages 1050-1063, October.
    13. Hossein Jahandideh & Kumar Rajaram & Kevin McCardle, 2020. "Production Campaign Planning Under Learning and Decay," Manufacturing & Service Operations Management, INFORMS, vol. 22(3), pages 615-632, May.
    14. Mili Mehrotra & Milind Dawande & Srinagesh Gavirneni & Mehmet Demirci & Sridhar Tayur, 2011. "OR PRACTICE---Production Planning with Patterns: A Problem from Processed Food Manufacturing," Operations Research, INFORMS, vol. 59(2), pages 267-282, April.

    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. Yokoyama, Masao, 1999. "The eclectic model for stochastic dynamic production cycling problem," International Journal of Production Economics, Elsevier, vol. 60(1), pages 359-367, April.
    2. Drexl, Andreas & Haase, Knut, 1993. "Sequential-analysis-based randomized-regret-methods for lotsizing and scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 323, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    3. Drexl, Andreas & Haase, Knut, 1992. "A new type of model for multi-item capacitated dynamic lotsizing and scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 286, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    4. Gaetan Belvaux & Laurence A. Wolsey, 2000. "bc --- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems," Management Science, INFORMS, vol. 46(5), pages 724-738, May.
    5. Drexl, Andreas & Jordan, Carsten & Kimms, Alf, 1997. "Gruppierungs- und Reihenfolgeprobleme in der Fertigung," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 447, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    6. 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.
    7. Kimms, Alf & Drexl, Andreas, 1996. "Multi-level lot sizing: A literature survey," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 405, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    8. Drexl, A. & Kimms, A., 1997. "Lot sizing and scheduling -- Survey and extensions," European Journal of Operational Research, Elsevier, vol. 99(2), pages 221-235, June.
    9. A. Kimms, 1997. "Demand shuffle—A method for multilevel proportional lot sizing and scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(4), pages 319-340, June.
    10. Karina Copil & Martin Wörbelauer & Herbert Meyr & Horst Tempelmeier, 2017. "Simultaneous lotsizing and scheduling problems: a classification and review of models," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 1-64, January.
    11. Drexl, Andreas & Haase, Knut, 1995. "Proportional lotsizing and scheduling," International Journal of Production Economics, Elsevier, vol. 40(1), pages 73-87, June.
    12. 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.
    13. Wolsey, Laurence A., 1995. "Progress with single-item lot-sizing," European Journal of Operational Research, Elsevier, vol. 86(3), pages 395-401, November.
    14. Carstensen, Peter, 1997. "Das Economic Lot Scheduling Problem: Überblick und LP-basiertes Verfahren," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 465, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    15. BELVAUX, Gaetan & WOLSEY, Laurence A., 1998. "Lot-sizing problems: modelling issues and a specialized branch-and-cut system BC-PROD," LIDAM Discussion Papers CORE 1998049, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    16. 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.
    17. Voelkel, Michael A. & Sachs, Anna-Lena & Thonemann, Ulrich W., 2020. "An aggregation-based approximate dynamic programming approach for the periodic review model with random yield," European Journal of Operational Research, Elsevier, vol. 281(2), pages 286-298.
    18. Kutzner, Sarah C. & Kiesmüller, Gudrun P., 2013. "Optimal control of an inventory-production system with state-dependent random yield," European Journal of Operational Research, Elsevier, vol. 227(3), pages 444-452.
    19. Saurabh Bansal & Mahesh Nagarajan, 2017. "Product Portfolio Management with Production Flexibility in Agribusiness," Operations Research, INFORMS, vol. 65(4), pages 914-930, August.
    20. Woonghee Tim Huh & Mahesh Nagarajan, 2010. "Technical note ---Linear Inflation Rules for the Random Yield Problem: Analysis and Computations," Operations Research, INFORMS, vol. 58(1), pages 244-251, February.

    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:oropre:v:50:y:2002:i:4:p:680-691. 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: 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.