Decentralized supply chain coordination through auction markets: Dynamic lot-sizing in distribution networks

International Journal of Production Research

Volumn 45, Issue 20, 2007, Pages 4715-4733

  Lee, Seokcheon ^a   Kumara, Soundar ^a  

^a The Pennsylvania State University   (United States)

Author keywords

Auction; Decentralized coordination; Dynamic lot sizing; Information sharing; Supply chain; Truth telling

Indexed keywords

ELECTRIC POWER DISTRIBUTION; INFORMATION DISSEMINATION; MARKETING; SOCIETIES AND INSTITUTIONS;

AUCTION; DECENTRALIZED COORDINATION; DYNAMIC LOT-SIZING; INFORMATION SHARING;

SUPPLY CHAINS;

EID: 34548385306     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540600844050     Document Type: Article

References (35)

1. Aggarwal, A. and Park, J.K., Improved algorithms for economic lot size problems. Oper. Res., 1993, 41, 549-571.
2. Aksoy, Y. and Erenguc, S.S., Multi-item inventory models with coordinated replenishments: a survey. Int. J. Oper. Prod. Mgmt., 1988, 8, 63-73.
3. Arkin, E., Joneja, D. and Roundy, R., Computational complexity of uncapacitated multiechelon production planning problems. Oper. Res. Lett., 1989, 8, 61-66.
4. Bahl, H.C., Ritzman, L.P. and Gupta, J.N., Determining lot sizes and resource requirements: a review. Oper. Res., 1987, 35, 329-344.
5. Baker, K.R., Dixon, P., Magazine, M.J. and Silver, E.A., An algorithm for the dynamic lotsize problem with time-varying production capacity constraints. Mgmt. Sci., 1978, 24, 1710-1720.
6. Bitran, G. and Yanasse, H.H., Computational complexity of the capacitated lot size problem. Mgmt. Sci., 1982, 28, 1174-1185.
7. Chen, F., Drezner, Z., Ryan, J.K. and Simchi-Levi, D., Quantifying the bullwhip effect in a simple supply chain: the impact of forecasting, lead times, and information. Mgmt. Sci., 2000, 46, 436-443.
8. Chen, H., Hearn, D.W. and Lee, C., A new dynamic programming algorithm for the single item capacitated dynamic lot size model. J. Glob. Optim., 1994, 4, 285-300.
9. Dellaert, N. and Jeunet, J., Randomized multi-level lot-sizing heuristics for general product structures. Eur. J. Oper. Res., 2003, 148, 211-228.
10. Drexl, A. and Kimms, A., Lot sizing and scheduling: survey and extensions. Eur. J. Oper. Res., 1997, 99, 221-235.
11. Ertogral, K. and Wu, S.D., Auction-theoretic coordination of production planning in the supply chain. IIE Trans., 2000, 32, 931-940.
12. Fan, M., Stallaert, J. and Whinston, A.B., Decentralized mechanism design for supply chain organizations using an auction market. Inf. Syst. Res., 2003, 14, 1-22.
13. Fisher, M.L., What is the right supply chain for your product? Harv. Bus. Rev., 1997, 75, 105-116.
14. Florian, M. and Klein, M., Deterministic production planning with concave costs and capacity constraints. Mgmt. Sci., 1971, 18, 12-20.
15. Florian, M., Lenstra, J.K. and Rinnooy Kan, A.H.G., Deterministic production planning: algorithms and complexity. Mgmt. Sci., 1980, 26, 12-20.
16. Hill, R.M., Note: dynamic lot sizing for a finite rate input process. Nav. Res. Log., 1997, 44, 221-228.
17. Jagannathan, R. and Rao, M.R., A class of deterministic planning problems. Mgmt. Sci., 1973, 19, 1295-1300.
18. Lee, H., Padmanabhan, V. and Whang, S., Information distortion in a supply chain: the bullwhip effect. Mgmt. Sci., 1997, 43, 546-558.
19. Lee, H. and Whang, S., Decentralized multi-echelon supply chains: incentives and information. Mgmt. Sci., 1999, 45, 633-640.
20. Lee, H. and Whang, S., Information sharing in supply chain, Int. J. Technol. Mgmt., 2000, 20, 373-387.
21. Li, Y. and Tan, G.W., Information sharing in a supply chain with dynamic consumer demand pattern, in 37th Annual Hawaii International Conference on System Sciences, 2004.
22. Maes, J., McClain, J.O. and Van Wassenhove, L.N., Multilevel capacitated lotsizing complexity and LP-based heuristics. Eur. J. Oper. Res., 1991, 53, 131-148.
23. McAfee, R.P. and McMillan, J., Auctions and bidding. J. Econ. Liter., 1987, 25, 699-738.
24. Milgrom, P., Auctions and bidding: a primer. J. Econ. Perspect., 1989, 3, 3-22.
25. Millar, H.H. and Yang, M., An application of Lagrangean decomposition to the capacitated multi-item lotsizing problem. Comput. Oper. Res., 1993, 20, 409-420.
26. Parkes, D.C., Ungar, L.H. and Foster, D.P., Accounting for cognitive costs in on-line auction design. In Agent Mediated Electronic Commerce, edited by P. Noriega and C. Sierra, pp. 25-40, 1999 (Springer: Berlin).
27. Parkes, D.C. and Ungar, L.H., Iterative combinatorial auctions: Theory and practice, in 17th National Conference on Artificial Intelligence, 2000, pp. 74-81.
28. Staggemeier, A.T. and Clark, A.R., A survey of lot sizing and scheduling models, in 23rd Annual Symposium of the Brazilian Operational Research Society, 2001.
29. Tan, G.W. and Wang, B., The relationship between product nature, demand patterns and information sharing strategies, in 22nd International Conference on Information Systems, 2001, pp. 543-549.
30. Thizy, J.M., Analysis of Lagrangean decomposition for the multi-item capacitated lot-sizing problem. Inf. Syst. Oper. Res., 1991, 29, 271-283.
31. 3) algorithm for the economic lot-sizing problem with constant capacities. Mgmt. Sci., 1996, 42, 142-150.
32. Vickrey, W., Counterspeculation, auction, and competitive sealed tenders. J. Finan., 1961, 16, 8-37.
33. Wadhwa, S., John, J. and Gandhi, A., Managing innovation in e-business based supply chain structures: role of demo models. Stud. Informat. Contr., 2002, 11, 217-231.
34. Wagelmans, A.P.M., Hossel, S.V. and Kolen, A., Economic lot-sizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case. Oper. Res., 1992, 40, 145-156.
35. Wagner, H. and Whitin, T.M., Dynamic version of the economic lot size model. Mgmt. Sci., 1958, 5, 89-96.