A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale

Computers and Operations Research

Volumn 39, Issue 7, 2012, Pages 1771-1778

  Mirmohammadi, Hamid S ^a   Eshghi, Kourosh ^b  

^a ISFAHAN UNIVERSITY OF TECHNOLOGY   (Iran)

^b SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

All units discount; Branch and bound; Dynamic programming; Dynamic quantity discount; Lot sizing with resale; Time complexity function

Indexed keywords

ALL-UNITS DISCOUNT; BRANCH AND BOUNDS; BRANCH-AND-BOUND ALGORITHMS; BREAK-POINTS; LEADTIME; LOT SIZE; LOT SIZING; MAIN STRUCTURE; MATERIAL REQUIREMENT PLANNING; OPTIMAL ALGORITHM; OPTIMAL ORDERING POLICY; PLANNING HORIZONS; POLYNOMIAL-TIME ALGORITHMS; QUANTITY DISCOUNT; SUB-PLANS; TEST PROBLEM; TIME COMPLEXITY;

ALGORITHMS; DYNAMIC PROGRAMMING; PURCHASING; SALES;

BRANCH AND BOUND METHOD;

EID: 81555202407     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.10.018     Document Type: Article

References (15)

1. W.C. Benton, and S. Park A classification of literature on determining the lot size under quantity discounts European Journal of Operational Research 92 1996 219 238 (Pubitemid 126372229)
2. L.M.A. Chan, A. Muriel, Z. Shen, and D. Simchi-Levi On the effectiveness of zero-inventory-ordering policies for the economic lot-sizing model with a class of piecewise linear cost structures Operations Research 50 6 2002 1058 1067
3. C. Chung, D.T. Chiang, and C. Lu An optimal algorithm for the quantity discount problem Journal of Operations Management 7 12 1987 165 177
4. S.S. Erenguc, and Y. Aksoy A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints Computers and Operations Research 17 2 1990 199 210 (Pubitemid 20648621)
5. A. Federgruen, and C. Lee The dynamic lot size model with quantity discount Naval Research Logistics 37 1990 707 713
6. Y. Feng, S. Chen, A. Kumar, and B. Lin Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in O(N log N) time Computers and Operations Research 38 2011 717 722
7. B.C. Giria, A.K. Jalanb, and K.S. Chaudhuri An economic production lot size model with increasing demand, shortages and partial backlogging International Transactions in Operational Research 12 2005 235 245 (Pubitemid 40345227)
8. B. Golany, R. MAman, and M. Yadin An efficient algorithm for the dynamic economic lot size problem Computers and Operations Research 19 6 1992 495 504 (Pubitemid 23559634)
9. D.R. Goossens, A.J.T. Maas, and Klundert Spieksma van de Exact algorithms for procurement problems under a total quantity discount structure European Journal of Operational Research 178 2007 603 626 (Pubitemid 44750491)
10. W.van den Heuvel, and A.P.M. Wagelmans An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem Computers and Operations Research 33 2006 3583 3599
11. S.H. Mirmohammadi, S. Shadrokh, and F. Kianfar An efficient optimal algorithm for the quantity discount problem in material requirement planning Computers and Operations Research 36 6 2009 1780 1788
12. S.P. Sethi A quantity discount lot size model with disposals International Journal of Production Research 22 1 1984 31 39
13. K. Sohn, and H. Hwang A dynamic quantity discount lot size model with resale European Journal of Operational Research 28 1987 293 297 (Pubitemid 17572006)
14. 3) algorithm for the economic lot-sizing problem with constant capacities Management Science 42 1 1996 142 150 (Pubitemid 126545091)
15. J. Xu, and L. Lu The dynamic lot size model with quantity discount: counterexamples and correction Naval Research Logistics 45 1998 419 422 (Pubitemid 128587343)