Abstract
This paper is concerned with a multi-period inventory problem where the demand and the supplier capacity of a given key resource are discrete random variables with known probability distribution. The procurement manager has to answer two types of questions: how much supplier quantity to reserve for each period (where all of these reservations have to madeprior to the start of the first period) and how large an order quantity to use at start of each period. An exact procedure, based on branch and bound and dynamic programming, as well as various heuristic methods to solve the problem are presented in this paper. Heuristic methods are shown to perform extremely well in the sense that they provide near optimal strategies while requiring much less computational effort than the exact method.
Zusammenfassung
Vorliegende Arbeit behandelt ein mehrperiodiges Lagerhaltungsproblem, worin sowohl die Nachfrage als auch die Lieferkapazität eines bestimmten Rohstoffs diskrete Zufallsvariable mit bekannter Verteilungsfunktion sind. Vor Beginn der ersten Periode ist die beim Lieferanten zu reservierende Rohstoffmenge für jede Periode zu bestimmen, darauf anschließend ist zu Beginn jeder Periode die tatsächlich zu bestellende Rohstoffmenge zu bestimmen. Ein exakter, aufbranch and bound und dynamischer Programmierung basierender Algorithmus und verschiedene Heuristiken für dieses Problem werden vorgestellt und miteinander verglichen. Die Heuristiken schneiden dabei sehr gut ab, da sie ausgezeichnete, suboptimale Lösungen mit erheblich weniger Rechenaufwand finden.
Similar content being viewed by others
References
Costa D, Silver EA (1996) Search mechanisms for tackling procurement problems with possible capacity reservations. Research Report 96/10, Faculty of Management, University of Calgary
Glover F (1992) Simple Tabu Thresholding in Optimization. Research Paper, Graduate School of Business, University of Boulder
Glover F, Taillard E, de Werra D (1993) A user's guide to tabu search. Ann Oper Res 41: 3–28
Glover F, Laguna M (1993) Tabu search, Reeves CR (ed) Modern Heuristic Techniques for Combinatorial Optimization, Blackwell, Oxford
Graves SC, Rinnooy Kan AH, Zipkin PH (1993) Logistics of production and inventory. Handbooks in Operations Research and Management Science, Vol. 4. North-Holland, Amsterdam
Hertz A, Taillard E, de Werra D (1995) Tabu search. Lenstra JK (ed) Local Search in Combinatorial Optimization (to appear)
Hillier FS, Lieberman GJ (1990) Introduction to Operations Research, Fifth Edn. McGraw-Hill, New York
Jain K, Silver EA (1995) The single period procurement problem where dedicated supplier capacity can be reserved. Naval Research Logistics 42: 915–934
Silver EA, Peterson R (1985) Decision systems for inventory management and production planning, Second Edn. Wiley, New York
Silver EA (1987) Policy and procedural issues in procurement and logistics for large scale projects in the oil and gas industry. Project Manag J 18: 57–62
Silver EA, Jain K (1994) Some ideas regarding reserving supplier capacity and selecting replenishment quantities in the project context. Int J Product Econ 35: 177–182
Silver EA, Costa D (1994) Dealing with a variable supplier capacity. Research Report 94/05, DMA. Ecole Polytechnique Fédérale de Lausanne
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Costa, D., Silver, E.A. Exact and approximate algorithms for the multi-period procurement problem where dedicated supplier capacity can be reserved. OR Spektrum 18, 197–207 (1996). https://doi.org/10.1007/BF01540156
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01540156