Capacitated production and subcontracting in a serial supply chain

IIE Transactions (Institute of Industrial Engineers)

Volumn 39, Issue 11, 2007, Pages 1031-1043

  Sargut, F Zeynep ^a   Romeijn, H Edwin ^a  

^a University of Florida   (United States)

Author keywords

Dynamic programming; Subcontracting; Two echelon lot sizing

Indexed keywords

COST FUNCTIONS; DYNAMIC PROGRAMMING; INVENTORY CONTROL; OUTSOURCING; POLYNOMIALS;

POLYNOMIAL SOLVABILITY; STATIONARY PRODUCTION; SUBCONTRACTING; TWO-ECHELON LOT SIZING;

SUPPLY CHAINS;

EID: 34548699145     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408170601091899     Document Type: Article

References (20)

1. Aggarwal, A. and Park, J. K. (1993) Improved algorithms for economic lot-size problems. Operations Research, 41:3, pp. 549-571.
2. Ahuja, R. K., Magnanti, T. L. and Orlin, J. B. (1993) Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ
3. Anderson, R. (2004) COMPANIES INTERNATIONAL: Ford, Getrag venture heads for Slovakia. Financial Times, U.S. Edition, 2, p. 22.
4. Atamtürk, A. and Hochbaum, D. S. (2001) Capacity acquisition, subcontracting, and lot sizing. Management Science, 47:8, pp. 1081-1100.
5. Bitran, G. R. and Yanasse, H. H. (1982) Computational complexity of the capacitated lot size problem. Management Science, 18, pp. 12-20.
6. Chan, L. M.A., Muriel, A., Shen, Z. and Simchi-Levi, D. (2002) 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, pp. 1058-1067.
7. Chan, L. M.A., Muriel, A., Shen, Z., Simchi-Levi, D. and Teo, C. P. (2002) Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures. Management Science, 11, pp. 1446-1460.
8. 2) algorithm for the NI/G/NI/ND capacitated lot size problem. Management Science, 34:3, pp. 420-426.
9. Federgruen, A. and Tzur, M. (1991) A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(nlog n) or O(n). Management Science, 37, pp. 909-925.
10. Florian, M. and Klein, M. (1971) Deterministic production planning with concave costs and capacity constraints. Management Science, 18, pp. 12-20.
11. Florian, M., Lenstra, J. K. and Kan, A. H.G. Rinnooy (1980) Deterministic production planning: Algorithms and complexity. Management Science, 26:7, pp. 669-679.
12. Kaminsky, P. and Simchi-Levi, D. (2003) Production and distribution lot sizing in a two stage supply chain. IIE Transactions, 35:11, pp. 1065-1075.
13. Heuvel, W. Van den and Wagelmans, A. P.M. (2006) An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem. Computers & Operations Research, 33:12, pp. 3583-3599.
14. 3) algorithm for the economic lot-sizing problem with constant capacities. Management Science, 42:1, pp. 142-150.
15. Van Hoesel, S., Romeijn, H. E., Morales, D. Romero and Wagelmans, A. P.M. (2005) Integrated lot-sizing in serial supply chains with production capacities. Management Science, 51:11, pp. 1706-1719.
16. Van Hoesel, S., Wagelmans, A. and Moerman, B. (1994) Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions. European Journal of Operational Research, 75, pp. 312-331.
17. Wagelmans, A., Van Hoesel, S. and Kolen, A. (1992) Economic lot sizing: an O(nlog n) algorithm that runs in linear time in the Wagner-Whitin case. Operations Research, 40, pp. S145-S156.
18. Wagner, H. M. and Whitin, T. M. (1958) Dynamic version of the economic lot size model. Management Science, 5, pp. 89-96.
19. Zangwill, W. I. (1968) Minimum concave cost flows in certain networks. Management Science, 14, pp. 429-450.
20. Zangwill, W. I. (1969) A backlogging model and a multi-echelon model of a dynamic economic lot size production system - a network approach. Management Science, 15:9, pp. 506-527.