IDEAS home Printed from https://ideas.repec.org/a/bla/popmgt/v32y2023i9p2740-2757.html
   My bibliography  Save this article

Capacity planning with limited information

Author

Listed:
  • Vic Anand
  • Ramji Balakrishnan
  • Srinagesh Gavirneni

Abstract

Limited information about the demand for some of the resources needed to produce goods and services (e.g., incomplete and imperfect bills of materials) forces firms to use heuristics when planning resource capacity. We examine the performance of five heuristics: two drawn from practice, two that modify observed approaches, and one motivated by theory. We measure performance as the ratio of the expected cost of supply–demand mismatch from using a heuristic to the value in the full‐information solution. Numerical analysis shows that a simple heuristic that is common in practice—plan rigorously for a few “driver” resources with high‐quality information and use ratios (e.g., 0.25 indirect labor hours per machine hour) to project the capacities for the remaining “non‐driver” resources—is robust and efficient. Using more than one driver resource to plan for the same non‐driver resource delivers significant gains. Reducing measurement error with respect to the consumption of driver resources dominates the gain from reducing errors in other aspects. Indeed, with high measurement error, collecting information that reduces other sources of error could decrease overall performance. Finally, a greedy algorithm of choosing the most expensive resources as drivers is optimal.

Suggested Citation

  • Vic Anand & Ramji Balakrishnan & Srinagesh Gavirneni, 2023. "Capacity planning with limited information," Production and Operations Management, Production and Operations Management Society, vol. 32(9), pages 2740-2757, September.
  • Handle: RePEc:bla:popmgt:v:32:y:2023:i:9:p:2740-2757
    DOI: 10.1111/poms.14004
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/poms.14004
    Download Restriction: no

    File URL: https://libkey.io/10.1111/poms.14004?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
    ---><---

    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:bla:popmgt:v:32:y:2023:i:9:p:2740-2757. 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: Wiley Content Delivery (email available below). General contact details of provider: http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1937-5956 .

    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.