Managing partially controllable raw material acquisition and outsourcing in production planning

IIE Transactions (Institute of Industrial Engineers)

Volumn 42, Issue 3, 2010, Pages 188-202

  Yang, Jian ^a   Qi, Xiangtong ^b  

^a NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Dynamic programming; Lot sizing; Outsourcing; Production planning

Indexed keywords

COMPUTATIONAL STUDIES; IN-HOUSE PRODUCTION; INVENTORY HOLDING; LOT SIZING; MANUFACTURING FIRMS; NP-HARDNESS; ONLINE EDITIONS; POLYNOMIAL ALGORITHM; PRODUCTION PLANNING;

COMPETITION; DYNAMIC PROGRAMMING; PLANNING; PRODUCTION CONTROL; PRODUCTION ENGINEERING; PROJECT MANAGEMENT;

OUTSOURCING;

EID: 77649310471     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408170903232555     Document Type: Article

References (39)

1. Aggarwal, A. and Park, J.K. (1993) Improved algorithm for economic lot size problems. Operations Research, 41(3), 549-571.
2. Aksen,D., Altinkemer,K. and Chand, S. (2003) The single-item lot sizing problem with immediate lost sales. European Journal of Operational Research, 147(3), 558-566.
3. Anily, S. and Tzur,M. (2006) Algorithms for themulti-itemmulti-vehicles dynamic lot sizing problem. Naval Research Logistics, 53(2), 157-169.
4. Atamẗurk, A. and Hochbaum,D.S. (2001) Capacity acquisition, subcontracting, and lot sizing. Management Science, 47(8), 1081-1100
5. Atamẗurk, A. and Kucukyavuz, S. (2005) Lot sizing with inventory bounds and fixed costs: polyhedral study and computation. Operations Research, 53(4), 711-730.
6. Bitran, G.R. and Matsuo, H. (1986) Approximation formulations for the single-product capacitated lot size problem. Operations Research, 34(1), 63-74.
7. Bitran, G.R. and Yanasse, H.H. (1982) Computational complexity of the capacitated lot size problem. Management Science, 28(10), 1174-1186.
8. Erickson, R.E., Monma, C.L. and Veinott, A.F. (1987) Send-and-split method for minimum-concave-cost network flows. Mathematics of Operations Research, 12(4), 634-664.
9. 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(8), 909-925.
10. Florian, M. and Klein, M. (1971) Deterministic production planning with concave costs and capacity constraints. Management Science, 18(1), 12-20.
11. Florian, M., Lenstra, J.K. and Rinnooy Kan, A.H.G. (1980) Deterministic production planning: algorithm and complexity. Management Science, 26(7), 669-679.
12. Ganas, I. and Papachristos, S. (2005) The single-product lot sizing problem with constant parameters and backlogging: exact results, a new solution, and all parameter stability regions. Operations Research, 53(1), 170-176.
13. Gavish, B. and Johnson, R.E. (1990) A fully polynomial approximation scheme for single product scheduling in a finite capacity facility. Operations Research, 38(1), 70-83.
14. Gopalakrishnan, M., Ding, K., Bourjolly, J.-M. and Mohan, S. (2001) A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover. Management Science, 47(6), 851-863.
15. Hsu, V.N., Li, C.-L. and Xiao, W. (2005) Dynamic lot size problem with one-way product substitution. IIE Transactions, 37(3), 201-215.
16. Jaruphongsa, W., Cetinkaya, S. and Lee, C.-Y. (2004) A two-echelon inventory optimization model with demand time window considerations. Journal of Global Optimization, 30(4), 347-366.
17. Jaruphongsa, W., Cetinkaya, S. and Lee, C.-Y. (2005) A dynamic lot-sizing model with multi-mode replenishments: polynomial algorithms for special cases with dual and multiple modes. IIE Transactions, 37(5), 453-467.
18. Kaminsky, P. and Simchi-Levi, D. (2003) Production and distribution lot sizing in a two stage supply chain. IIE Transactions, 35(11), 1065-1075.
19. Lee, C.-Y., Cetinkaya, S. and Jaruphongsa, W. (2003) A dynamic model for inventory lot sizing and outbound shipment scheduling at a third-party warehouse. Operations Research, 51(5), 735-747.
20. Lee, C.-Y., Cetinkaya, S. and Wagelmans, A.P.M. (2001) A dynamic lot sizing model with demand time windows. Management Science, 47(10), 1384-1395.
21. Li, C.-L., Hsu, V.N. and Xiao, W. (2004) Dynamic lot sizing with batch ordering and truckload discounts. Operations Research, 52(4), 639-654.
22. Merzifonluóglu, Y., Geunes, J. and Romeijn, H.E. (2007) Integrated capacity, demand, and production planning with subcontracting and overtime options. Naval Research Logistics, 54(4), 433-447.
23. Sandbothe, R.A. and Thompson, G.L. (1990) A forward algorithm for the capacitated lot size model with stockouts. Operations Research, 38(3), 474-486.
24. Sargut, F.Z. and Romeijn, H.E. (2007a) Lot-sizing with non-stationary cumulative capacities. Operations Research Letters, 35(4), 549-557.
25. Sargut, F.Z. and Romeijn, H.E. (2007b) Capacitated production and subcontracting in a serial supply chain. IIE Transactions, 39(11), 1031-1043.
26. Stadtler, H. (2003) Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot sizing windows. Operations Research, 51(3), 487-502.
27. Teo, C.-P. and Bertsimas, D. (2001) Multistage lot sizing problems via randomized rounding. Operations Research, 49(4), 599-608.
28. Teunter, R.H., Bayindir, Z.P. and Van den Heuvel, W. (2006) Dynamic lot sizing with production returns and remanufacturing. International Journal of Production Research, 44(20), 4377-4400.
29. Van den Heuvel. (2006) The economic lot-sizing problem: New results and extensions. Ph.D. Thesis. Erasmus Research Institute of Management, Erasmus University, Rotterdam, The Netherlands.
30. Van den Heuvel, W. and Wagelmans, A.P.M. (2008) Four equivalent lot-sizing models. Operations Research Letters, 36(4), 465-470.
31. Van Hoesel, C.P.M. andWagelmans, A.P.M. (1996) An O(T3) algorithm for the economic lot sizing problem with constant capacities. Management Science, 42(1), 142-150.
32. Van Hoesel, C.P.M. and Wagelmans, A.P.M. (2001) Fully polynomial approximation schemes for single-item capacitated economic lotsizing problems. Mathematics of Operations Research, 26(2), 339-357.
33. Van Hoesel, S., Romeijn, H.E., Morales, D.R. and Wagelmans, A.P.M. (2005) Integrated lot sizing in serial supply chains with production capacities. Management Science, 51(11), 1706-1719.
34. Wagelmans, A.P.M., Van Hoesel, S. and Kolen, A. (1992) An O(n log n) algorithm that runs in linear time in theWagner-Whitin case. Operations Research, 40(1), S145-S156.
35. Wagner, H.M. (1960) A postscript to "dynamic problems in the theory of the firm." Naval Research Logistics Quarterly, 7(1), 7-12.
36. Wagner,H.M. andWhitin, T.M. (1958) Dynamic version of the economic lot size model. Management Science, 5(1), 89-96.
37. Wolsey, L.A. (2002) Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation. Management Science, 48(12), 1587-1602.
38. Yang, J., Golany, B. and Yu, G. (2005) A concave-cost production planning problem with remanufacturing options. Naval Research Logistics, 52(5), 443-458.
39. Zangwill,W.I. (1969)Abacklogging model and amultiechelon model of a dynamic economic lot size production system-a network approach. Management Science, 15(9), 506-527.