zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Inventory lot-sizing with supplier selection. (English) Zbl 1076.90002
Summary: This paper presents a multi-period inventory lot-sizing scenario, where there are multiple products and multiple suppliers. We consider a situation where the demand of multiple discrete products is known over a planning horizon. Each of these products can be sourced from a set of approved suppliers, a supplier-dependent transaction cost applying for each period in which an order is placed on a supplier. A product-dependent holding cost per period applies for each product in the inventory that is carried across a period in the planning horizon. The decision maker needs to decide what products to order in what quantities with which suppliers in which periods. An enumerative search algorithm and a heuristic are presented to address the problem.

90B05Inventory, storage, reservoirs
Full Text: DOI
[1] Wagner, H. M.; Whitin, T. M.: Dynamic version of the economic lot-size model. Management science 5, 89-96 (1958) · Zbl 0977.90500
[2] Bahl, H. C.; Ritzman, L. P.; Gupta, J. N. D.: Determining lot sizes and resource requirementsa review. Operations research 35, 329-345 (1987)
[3] Harris FW. Operations and cost, Factory Management Series. Chicago: A.W. Shaw Co., 1915.
[4] Aggarwal, A.; Park, J. K.: Improved algorithms for economic lot-size problems. Operations research 41, 549-571 (1993) · Zbl 0820.90035
[5] Federgruen, A.; Tzur, M.: A simple forward algorithm to solve general dynamic lot sizing models with n periods in $O(nlogn)$ or $O(n)$ time. Management science 37, 909-925 (1991) · Zbl 0748.90011
[6] Benton, W. C.; Whybark, D. C.: Material requirements planning (MRP) and purchase discounts. Journal of operations management 2, 137-143 (1982)
[7] Whybark, D. C.; Williams, J. C.: Material requirements planning under uncertainty. Decision sciences 7, 595-606 (1976)
[8] Shaw, D. X.; Wagelmans, A. P. M.: An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs. Management science 44, 831-838 (1998) · Zbl 0989.90051
[9] Lee, C. -.Y.Ç; Etinkaya, S.; Wagelmans, A. P. M.: A dynamic lot-sizing model with demand time windows. Management science 47, 1384-1395 (2001) · Zbl 1232.90189
[10] Hariga, M.; Haouari, M.: An EOQ lot sizing model with random supplier capacity. International journal of production economics 58, 39-47 (1999)
[11] Ozdamar, L.; Bozyel, M. A.: The capacitated lot-sizing problem with overtime decisions and setup times. IIE transactions 32, 1043-1057 (2000)
[12] Sox, C. R.; Gao, Y.: The capacitated lot-sizing problem with setup carry-over. IIE transactions 31, 173-181 (1999)
[13] Agra, A.; Constantino, M.: Lotsizing with backlogging and start-upsthe case of wagner--whitin costs. Operation research letters 25, 81-88 (1999) · Zbl 0973.90001
[14] Loparic, M.; Pochet, Y.; Wolsey, L. A.: The uncapacitated lot-sizing problem with sales and safety stocks. Mathematical programming 89, 487-504 (2001) · Zbl 0992.90022
[15] Eppen, G. D.; Martin, R. K.: Solving multi-item lot-sizing problems with variable redefinition. Operations research 35, 832-848 (1987) · Zbl 0639.90046
[16] Pfeiffer, T.: Transfer pricing and decentralized dynamic lot-sizing in multi-stage, multi-product production processes. European journal of operational research 116, 319-330 (1999) · Zbl 1009.90009
[17] Sambasivan, M.; Schmidt, C. P.: A heuristic procedure for solving multi-plant multi-item multi-period capacitated lot-sizing problems. Asia-Pacific journal of operational research 19, 87-105 (2002) · Zbl 1165.90544
[18] Wolsey LA. Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation. CORE Discussion Paper, 2002-12, Universite Catholique de Louvain, Belgium, 2002.
[19] Silver, E. A.; Meal, H. C.: A heuristic for selecting lot size quantities for the case of a deterministic time varying rate and discrete opportunities for replenishment. Production and inventory management 14, 64-74 (1973)
[20] Evans, J. R.: An efficient implementation of the wagner--whitin algorithm for dynamic lot sizing. Journal of operations management 5, 235-239 (1985)
[21] Jacobs, F. R.; Khumawala, B.: A simplified procedure for optimal single-level lot sizing. Production and inventory management 28, 39-43 (1987)
[22] Saydam, C.; Mcknew, M.: A fast microcomputer program for ordering using the wagner--whitin algorithm. Production and inventory management 28, 15-19 (1987)
[23] Heady, R. B.; Zhu, Z.: An improved implementation of the wagner--whitin algorithm. Production and operations management 3, 55-63 (1994)
[24] Wagelmans, A.; Van Hoesel, S.; Kolen, A.: Economic lot sizingan $O(nlogn)$ algorithm that runs in linear time in wagner--whitin case. Operations research 40, S145-S156 (1992) · Zbl 0771.90031
[25] Rosenthal, E. C.; Zydiak, J. L.; Chaudhry, S. S.: Vendor selection with bundling. Decision sciences 26, 35-48 (1995)
[26] Chaudhry, S. S.; Frost, F. G.; Zydiak, J. L.: Vendor selection with price breaks. European journal of operational research 70, 52-66 (1993) · Zbl 0800.90115
[27] Ganeshan, R.: Managing supply chain inventoriesa multiple retailer, one warehouse, multiple supplier model. International journal of production economics 59, 341-354 (1999)
[28] Kasilingam, R. G.; Lee, C. P.: Selection of vendors--a mixed integer programming approach. Computers and industrial engineering 31, 347-350 (1996)
[29] Jayaraman, V.; Srivastava, R.; Benton, W. C.: Supplier selection and order quantity allocationa comprehensive model. The journal of supply chain management 35, 50-58 (1999)