Capacity planning with limited information

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 mod...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Production and operations management 2023-09, Vol.32 (9), p.2740-2757
Hauptverfasser: Anand, Vic, Balakrishnan, Ramji, Gavirneni, Srinagesh
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1059-1478
1937-5956
DOI:10.1111/poms.14004