Algorithms for multi-item procurement planning with case packs

IIE Transactions (Institute of Industrial Engineers)

Volumn 44, Issue 3, 2012, Pages 181-198

  Chen, Shuang ^a   Geunes, Joseph ^a   Mishra, Ajay ^b  

^a J Crayton Pruitt Family Department of Biomedical Engineering   (United States)

^b BINGHAMTON UNIVERSITY   (United States)

Author keywords

Case pack planning; dynamicprogramming; mixed integer linear programming; retail supply chains dynamic lotsizing

Indexed keywords

COMPUTATIONAL TESTS; DETERMINISTIC DEMAND; DISTRIBUTION CHAINS; EXACT APPROACH; FIXED NUMBERS; GENERAL MODEL; HEURISTIC APPROACH; HEURISTIC SOLUTIONS; LARGE SIZES; MIXED INTEGER LINEAR PROGRAMMING; MIXED-INTEGER PROGRAMMING; MULTI-ITEM; OPTIMAL SOLUTIONS; PLANNING PROBLEM; PROBLEM FORMULATION; REDUCED ORDER; RETAIL SUPPLY CHAIN; STOCK KEEPING UNIT; STRONGLY NP-HARD; UNCERTAIN DEMAND; VALID INEQUALITY;

DYNAMIC PROGRAMMING; HEURISTIC METHODS; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; SUPPLY CHAINS;

PROBLEM SOLVING;

EID: 84862911809     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/0740817X.2011.596510     Document Type: Article

References (40)

1. Aggarwal, A. and Park, J.K. (1993) Improved algorithms for economic lot-size problems. Operations Research, 41, 549-571.
2. Ahuja, R.K.,Magnanti, T.L. and Orlin, J.B. (1993) Network Flows. Prentice Hall, Englewood Cliffs, NJ.
3. Akartunali, K. andMiller, A.J. (2009)Aheuristic approach for big bucket multi-level production planning problems. European Journal of Operational Research, 193, 396-411.
4. Anily, S., Tzur, M. and Wolsey, L.A. (2009) Multi-item lot-sizing with joint set-up costs. Mathematical Programming Series A, 119, 79-94.
5. Atamturk, A. and Munoz, J.C. (2004) A study of the lot-sizing polytope. Mathematical Programming, 98, 443-465. (Pubitemid 40871713)
6. Bahl, H.C. and Ritzman, L.P. (1984) An integrated model for master scheduling, lot sizing and capacity requirements planning. Journal of Operational Research Society, 35(5), 389-399.
7. Barany, I., Van Roy, T.J. and Wolsey, L.A. (1984) Strong formulations for multi-item capacitated lot-sizing. Management Science, 30(10), 1255-1261. (Pubitemid 14641369)
8. Belvaux, G. and Wolsey, L.A. (2000) BC-Prod: A specialized branchand-cut system for lot-sizing problems. Management Science, 46(5), 724-738.
9. Belvaux, G. andWolsey, L.A. (2001) Modeling practical lot-sizing problems as mixed-integer programs. Management Science, 47(7), 993-1007. (Pubitemid 34192821)
10. Bhatia,M. and Palekar, U.S. (2001) A variable redefinition approach for the lot sizing problem with strong set-up interactions. IIE Transactions, 33, 357-370. (Pubitemid 32394199)
11. Billington, P.J., McClain, J.O. and Thomas, L.J. (1983) Mathematical programming approaches to capacity-constrained MRP systems: Review, formulation and problem deduction. Management Science, 29(10), 1126-1141. (Pubitemid 14468571)
12. Blackburn, J.D. and Millen, R.A. (1984) Simultaneous lot sizing and capacity planning in multistage assembly systems. European Journal of Operations Research, 16, 84-93.
13. Bookbinder, J.H. and Tan, J.Y. (1988) Strategies for the probabilistic lot sizing problem with service-level constraints. Management Science, 34(9), 1096-1108.
14. Chand, S. and Sethi, S. (1983) Finite-production-rate inventory models with first-and-second-shift setups. Naval Research Logistics Quarterly, 30, 401-414. (Pubitemid 14451726)
15. Chen, S. and Geunes, J. (2011) Integrated case-pack configuration and procurement planning. Working Paper, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL.
16. Federgruen, A. and Tzur,M. (1991) A simple forward algorithm to solve general dynamic lot-sizing models with n periods in O(n log n) or O(n) time. Management Science, 37, 909-925. (Pubitemid 23585668)
17. Federgruen, H., Meissner, J. and Tzur, M. (2007) Progressive interval heuristics for multi-item capacitated lot sizing problems. Operations Research, 55(3), 490-502. (Pubitemid 351159505)
18. Feige, U. (1998) A threshold of ln n for approximating set cover. Journal of the ACM, 45(4), 634-652. (Pubitemid 128488790)
19. Florian, M., Lenstra, J.K. and Rinnooy Kan, A.H.G. (1980) Deterministic production planning: Algorithms and complexity. Management Science, 26, 669-679. (Pubitemid 11442296)
20. Freimer, M.B., Gao, L. and Thomas, D.J. (2007) Optimal inventory control with retail pre-packs.Working paper, Smeal College of Business, Penn State University, University Park, PA.
21. Friend, S.C. and Walker, P.H. (2001) Welcome to the new world of merchandising. Harvard Business Review, 71, 133-141.
22. Garey, M.R. and Johnson, D.S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York, NY.
23. Hajewski, D. (2006) Kohl's tailors inventory to size of its customers: Stores' clothing will match buyers' shapes. Milwaukee Journal Sentinel, January 23. http://www.highbeam.com/doc/1G1-141190586.html
24. Krarup, J. and Bilde, O. (1977) Plant location, set covering and economic lot sizes: An O(mn) algorithm for structured problems. Numerische Methoden Bei Optimierungsaufgaben. Birkhauser, Basel, 155-180.
25. Li, C., Hsu, V.N. and Xiao, W. (2004) Dynamic lot sizing with batch ordering and truckload discounts. Operations Research, 52(4), 639-654.
26. Loparic, M., Pochet, Y. and Wolsey, L.A. (2001) The uncapacitated lotsizing problem with sales and safety stocks. Mathematical Programming, 89, 487-504. (Pubitemid 33758495)
27. Parveen, S. and Haque, A.F.M.A. (2007) A heuristic solution of multiitem single level capacitated dynamic lot-sizing problem. Journal of Mechanical Engineering, 38, 1-7.
28. Pessemier, E.A. (1980) Retail Assortments-Some Theoretical and Applied Problems. Marketing Science Institute, Cambridge, MA.
29. Pochet,Y. andWolsey, L.A. (1994) Polyhedra for lot-sizing withWagner-Whitin costs. Mathematical Programming, 67, 297-323.
30. Pochet, Y. andWolsey, L.A. (2006) Production Planning by Mixed Integer Programming, Springer, New York, NY.
31. Reda, S. (2006) Taking the measure of modern fitting: Sizing up sizing. Stores, 88(1), 30-34.
32. Roll, Y. and Karni, R. (1991) Multi-item, multi-level lot sizing with capacity constraint. European Journal of Operational Research, 51, 73-87. (Pubitemid 21730852)
33. Silver, E.A. and Meal, H.C. (1973) A heuristic for selecting lot size quantities for the case of a deterministic time-varying demand rate and discrete opportunities for replenishment. Production and Inventory Management Journal, 14(2), 64-74.
34. Stadtler, H. (2003) Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows. Operations Research, 51, 487-502.
35. Stowers, C.L. and Palekar, U.S. (1997) Lot sizing problems with strong set-up interactions. IIE Transactions, 29, 167-179. (Pubitemid 127755237)
36. Van Hoesel, C.P.M. and Wagelmans, A.P.M. (2000) Parametric analysis of setup cost in the economic lot-sizing model without speculative motives. International Journal of Production Economics, 66, 13-22.
37. Vander, E.J. (1968) Investigation of a class of constrained inventory problems. Doctoral dissertation, Yale University, New Haven, CT.
38. Wagelmans, A.P.M., Van Hoesel, S. and Kolen, A. (1992) Economic lot-sizing: An O(n log n) algorithm that runs in linear time in the Wagner-Whitin case. Operations Research, 40, 145-156.
39. Wagner,H.M. andWhitin, T.M. (1958) Dynamic version of the economic lot-size model. Management Science, 5(1), 89-96.
40. Wolsey, L.A. (2002) Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation. Management Science, 48(12), 1587-1602.