Iterative combinatorial auctions for managing product transitions in semiconductor manufacturing

References

• Abrache, J., Crainic, T. G., Gendreau, M. and Aouam, T. (2014) An auction mechanism for multilateral procurement based on Dantzig-Wolfe decomposition, in Y. Benadada, J. Boukachour, and A.A. Elhilali (eds.), Proceedings of the 2nd International IEEE Conference on Logistics Operations Management, pp. 16–22, ENSIAS, Rabat, Maroc.
   Google Scholar
• Abrache, J., Crainic, T.G., Gendreau, M. and Aouam, T. (2013) A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods. INFOR: Information Systems and Operational Research, 51(1), 2–14.
   Web of Science ®Google Scholar
• Abrache, J., Crainic, T.G., Gendreau, M. and Rekik, M. (2007) Combinatorial auctions. Annals of Operations Research, 153, 131–164.
   Web of Science ®Google Scholar
• Adhau, S., Mittal, M.L. and Mittal, A. (2012) A multi-agent system for distributed multi-project scheduling: An auction-based negotiation approach. Engineering Applications of Artificial Intelligence, 25, 1738–1751.
   Web of Science ®Google Scholar
• Adhau, S., Mittal, M.L. and Mittal, A. (2013) A multi-agent system for decentralized multi-project scheduling with resource transfers. International Journal of Production Economics, 146, 646–661.
   Web of Science ®Google Scholar
• Andersson, A., Tenhunen, M. and Ygge, F. (2000) Integer programming for combinatorial auction winner determination, in Proceedings of the Fourth International Conference on MultiAgent Systems, IEEE Press, Piscataway, NJ, pp. 39–46.
   Google Scholar
• Angelus, A. and Porteus, E.L. (2002) Simultaneous capacity and production management of short-life-cycle, produce-to-stock goods under stochastic demand. Management Science, 48(3), 399–413.
   Web of Science ®Google Scholar
• Araúzo, J.A., Pajares, J. and Lopez-Paredes, A. (2010) Simulating the dynamic scheduling of project portfolios. Simulation Modelling Practice and Theory, 18(10), 1428–1441.
   Web of Science ®Google Scholar
• Ausubel, L.M. (2004) An efficient ascending-bid auction for multiple objects. American Economic Review, 94(5), 1452–1475.
   Web of Science ®Google Scholar
• Ausubel, L.M. (2006) An efficient dynamic auction for heterogeneous commodities. American Economic Review, 96(3), 602–629.
   Web of Science ®Google Scholar
• Ausubel, L.M. and Milgrom, P.R. (2002) Ascending auctions with package bidding. Frontiers of Theoretical Economics, 1(1), 1.
   Google Scholar
• Ausubel, L.M., Milgrom, P., (2006) The lovely but lonely Vickrey auction, in P. Cramton, Y. Shoham, and R. Steinberg (eds.), Combinatorial Auctions, pp. 22–26, MIT Press, Cambridge, MA.
   Google Scholar
• Bichler, M., Shabalin, P. and Ziegler, G. (2013) Efficiency with linear prices? A game-theoretical and computational analysis of the combinatorial clock auction. Information Systems Research, 24(2), 394–417.
   Web of Science ®Google Scholar
• Bikhchandani, S. and Ostroy, J.M. (2002) The package assignment model. Journal of Economic Theory, 107(2), 377–406.
   Web of Science ®Google Scholar
• Bilginer, O. and Erhun, F. (2010) Managing Product Introductions and Transitions, John Wiley, New York, NY, pp. 1–12.
   Google Scholar
• Billington, C., Lee, H.L. and Tang, C.S. (1998) Successful strategies for product rollovers. Sloan Management Review, (Spring), 23–30.
   Google Scholar
• Blumrosen, L. and Nisan, N. (2007) Combinatorial Auctions, Springer, New York, NY.
   Google Scholar
• Caprara, A., Fischetti, M. and Toth, P. (1999) A heuristic method for the set covering problem. Operations Research, 47(5), 730–743.
   Web of Science ®Google Scholar
• Carrillo, J.E. (2005) Industry clockspeed and the pace of new product development. Production and Operations Management, 14(2), 125–141.
   Web of Science ®Google Scholar
• Carrillo, J.E. and Franza, R.M. (2006) Investing in product development and production capabilities: The crucial linkage between time-to-market and ramp-up time. International Journal of Production Economics, 171, 536–556.
   Google Scholar
• Confessore, G., Giordani, S. and Rismondo, S. (2007) A market-based multi-agent system model for decentralized multi-project scheduling. Annals of Operations Research, 150(1), 115–135.
   Web of Science ®Google Scholar
• Cramton, P., Shoham, Y. and Steinberg, R. (2007) An overview of combinatorial auctions. ACM SIGecom Exchanges, 7(1), 3–14.
   Google Scholar
• Dantzig, G.B. and Wolfe, P. (1960) Decomposition principle for linear programs. Operations Research, 8(1), 101–111.
   Web of Science ®Google Scholar
• Davis, L. (1991) Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York, NY.
   Google Scholar
• De Vries, S., Schummer, J. and Vohra, R.V. (2007) On ascending Vickrey auctions for heterogeneous objects. Journal of Economic Theory, 132(1), 95–118.
   Web of Science ®Google Scholar
• Desaulniers, G., Desrosiers, J. and Solomon, M.M. (2006) Column Generation, Springer Science & Business Media, New York, NY.
   Google Scholar
• De Vries, S. and Vohra, R.V. (2003) Combinatorial auctions: A survey. INFORMS Journal on Computing, 15(3), 284–309.
   Web of Science ®Google Scholar
• Dietrich, B.J. and Forrest, J. (2002) A Column Generation Approach for Combinatorial Auctions. Springer, New York, NY, pp. 15–26.
   Google Scholar
• Druehl, C.T., Schmidt, G.M. and Souza, G.C. (2009) The optimal pace of product updates. European Journal of Operational Research, 192, 621–633.
   Web of Science ®Google Scholar
• Erkoc, M. and Wu, S.D. (2005) Managing high-tech capacity expansion via reservation contracts. Production and Operations Management, 14(2), 232–251.
   Web of Science ®Google Scholar
• Fisher, M.L. (1981) The Lagrangian relaxation method for solving integer programming problems. Management Science, 27(1), 1–18.
   Web of Science ®Google Scholar
• Fordyce, K., Wang, C.-T., Chang, C.-H., Degbotse, A., Denton, B., Lyon, P., Milne, R.J., Orzell, R., Rice, R. and Waite, J. (2011) The ongoing challenge: Creating an enterprise-wide detailed supply chain plan for semiconductor and package operations, in Planning Production and Inventories in the Extended Enterprise, pp. 313–387, Springer, New York, NY.
   Google Scholar
• Glover, F. and Laguna, M. (1998) Tabu search, in Handbook of Combinatorial Optimization, Springer, New York, NY, pp. 2093–2229.
   Google Scholar
• Gul, F. and Stacchetti, E. (1999) Walrasian equilibrium with gross substitutes. Journal of Economic Theory, 87(1), 95–124.
   Web of Science ®Google Scholar
• Günlük, O., Ladányi, L. and de Vries, S. (2005) A branch-and-price algorithm and new test problems for spectrum auctions. Management Science, 51(3), 391–406.
   Web of Science ®Google Scholar
• Guta, B. (2003) Subgradient optimization methods in integer programming with an application to a radiation therapy problem. PhD thesis, University of Kaiserslautern, Germany.
   Google Scholar
• Ho, T.-H., Savin, S. and Terwiesch, C. (2002) Managing demand and sales dynamics in new product diffusion under supply constraint. Management Science, 48(2), 187–206.
   Web of Science ®Google Scholar
• Jin, M. and Wu, S.D. (2007) Capacity reservation contracts for high-tech industry. European Journal of Operational Research, 176, 1659–1677.
   Web of Science ®Google Scholar
• Jones, J.L. and Koehler, G.J. (2005) A heuristic for winner determination in rule-based combinatorial auctions. INFORMS Journal on Computing, 17(4), 475–489.
   Web of Science ®Google Scholar
• Kacar, N.B., Mönch, L. and Uzsoy, R. (2016) Modeling cycle times in production planning models for wafer fabrication. IEEE Transactions on Semiconductor Manufacturing, 29(2), 153–167.
   Web of Science ®Google Scholar
• Karabuk, S. and Wu, S.D. (2002) Decentralizing semiconductor capacity planning via internal market coordination. IIE Transactions, 34, 743–759.
   Web of Science ®Google Scholar
• Karabuk, S. and Wu, S.D. (2003) Coordinating strategic capacity planning in the semiconductor industry. Operations Research, 51(6), 839–849.
   Web of Science ®Google Scholar
• Karabuk, S. and Wu, S.D. (2005) Incentive schemes for semiconductor capacity allocation: A game theoretic analysis. Production and Operations Management, 14(2), 175–188.
   Web of Science ®Google Scholar
• Klastorin, T. and Tsai, W. (2004) New product introduction: Timing, design and pricing. Manufacturing and Service Operations Management, 6(4), 302–320.
   Google Scholar
• Koca, E., Souza, G.C. and Druehl, C.T. (2010) Managing product rollovers. Decision Sciences, 41(2), 403–423.
   Web of Science ®Google Scholar
• Kolisch, R., Sprecher, A. and Drexl, A. (1995) Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science, 41(10), 1693–1703.
   Web of Science ®Google Scholar
• Kutanoglu, E. and Wu, S.D. (1999) On combinatorial auction and Lagrangean relaxation for distributed resource scheduling. IIE Transactions, 31(9), 813–826.
   Web of Science ®Google Scholar
• Kwasnica, A.M., Ledyard, J.O., Porter, D. and DeMartini, C. (2005) A new and improved design for multiobject iterative auctions. Management Science, 51(3), 419–434.
   Web of Science ®Google Scholar
• Lavi, R. (2007) Computationally efficient approximation mechanisms, in Algorithmic Game Theory, pp. 301–329, Cambridge University Press, New York, NY.
   Google Scholar
• Leachman, R.C. (2001) Semiconductor production planning, in Handbook of Applied Optimization, pp. 746–762, Oxford University Press, Oxford, UK.
   Google Scholar
• Lehmann, D., Müller, R. and Sandholm, T. (2006) The winner determination problem, in P. Cramton, Y. Shoham, and R. Steinberg (eds.), Combinatorial Auctions, pp. 297–318, MIT Press, Cambridge, MA.
   Google Scholar
• Levinthal, D.A. and Purohit, D. (1989) Durable goods and product obsolescence. Marketing Science, 8(1), 35–56.
   Web of Science ®Google Scholar
• Li, H., Graves, S.C. and Rosenfeld, D.B. (2010) Optimal planning quantities for product transition. Production and Operations Management, 19(2), 142–155.
   Web of Science ®Google Scholar
• Li, H., Graves, S.C. and Huh, W.T. (2014) Optimal capacity conversion for product transitions under high service requirements. Management Science, 16(1), 46–60.
   Google Scholar
• Liang, C., Cakanyildirim, M. and Sethi, S.P. (2014) Analysis of product rollover strategies in the presence of strategic customers. Management Science, 60(4), 1033–1056.
   Web of Science ®Google Scholar
• Lim, W.S. and Tang, C.S. (2006) Optimal product rollover strategies. European Journal of Operational Research, 174, 905–922.
   Web of Science ®Google Scholar
• Mallik, S. (2007) Contracting over multiple parameters: Capacity allocation in semiconductor manufacturing. European Journal of Operational Research, 182(1), 174–193.
   Web of Science ®Google Scholar
• Mallik, S. and Harker, P.T. (2004) Coordinating supply chains with competition: Capacity allocation in semiconductor manufacturing. European Journal of Operational Research, 159(2), 330–347.
   Web of Science ®Google Scholar
• Mas-Colell, A., Whinston, M.D., Green, J.R., et al. (1995) Microeconomic Theory, volume 1. Oxford University Press New York, NY.
   Google Scholar
• Mishra, D. (2010) Efficient iterative combinatorial auctions, in Wiley Encyclopedia of Operations Research and Management Science, John Wiley, New York, NY.
   Google Scholar
• Mishra, D. and Parkes, D.C. (2007) Ascending price Vickrey auctions for general valuations. Journal of Economic Theory, 132(1), 335–366.
   Web of Science ®Google Scholar
• Missbauer, H. and Uzsoy, R. (2011) Optimization models of production planning problems, in Planning Production and Inventories in the Extended Enterprise, Springer, New York, NY.
   Google Scholar
• Mönch, L., Uzsoy, R. and Fowler, J.W. (2018) A survey of semiconductor supply chain models part iii: Master planning, production planning, and demand fulfilment. International Journal of Production Research, 56(13), 4565–4584.
   Web of Science ®Google Scholar
• Narahari, Y. (2014) Game Theory and Mechanism Design, volume 4. World Scientific. Singapore.
   Google Scholar
• Narahari, Y., Garg, D., Narayanam, R. and Prakash, H. (2009) Game Theoretic Problems in Network Economics and Mechanism Design Solutions, Springer, London.
   Google Scholar
• O’Neill, R.P., Sotkiewicz, P.M., Hobbs, B.F., Rothkopf, M.H. and Stewart Jr, W.R. (2005) Efficient market-clearing prices in markets with nonconvexities. European Journal of Operational Research, 164(1), 269–285.
   Web of Science ®Google Scholar
• Osborne, M. and Rubinstein, A. (1990) Bargaining and Markets, Academic Press, San Diego, CA.
   Google Scholar
• Padmanabhan, V., Rajiv, S. and Srinivasan, K. (1997) New products, upgrades and new releases: A rationale for sequential product introduction. Journal of Marketing Research, 34(4), 456–472.
   Web of Science ®Google Scholar
• Parkes, D.C. (2001) Iterative combinatorial auctions achieving economic and computational efficiency. Thesis, University of Pennsylvania, Philadelphia, PA.
   Google Scholar
• Parkes, D.C. and Ungar, L.H. (2001) Iterative combinatorial auctions: Achieving economic and computational efficiency. University of Pennsylvania, Philadelphia, PA.
   Google Scholar
• Rajagopalan, S., Singh, M.R. and Morton, T.E. (1998) Capacity expansion and replacement in growing markets with uncertain technological breakthroughs. Management Science, 44(1), 12–30.
   Web of Science ®Google Scholar
• Rash, E. and Kempf, K. (2012) Product line design and scheduling at Intel. Interfaces, 42(5), 425–436.
   Web of Science ®Google Scholar
• Sandholm, T. (2002) Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence, 135(1-2), 1–54.
   Web of Science ®Google Scholar
• Song, W., Kang, D., Zhang, J. and Xi, H. (2017) A multi-unit combinatorial auction based approach for decentralized multi-project scheduling. Autonomous Agents and Multi-Agent Systems, 31(6), 1548–1577.
   Web of Science ®Google Scholar
• Souza, G.C. (2004) Product introduction decisions in a duopoly. European Journal of Operational Research, 152, 745–757.
   Web of Science ®Google Scholar
• Souza, G.C., Bayus, B.L. and Wagner, H.M. (2004) New-product strategy and industry clockspeed. Management Science, 50(4), 537–549.
   Web of Science ®Google Scholar
• Toptal, A. and Sabuncuoglu, I. (2014) Distributed scheduling: a review of concepts and applications. International Journal of Production Research, 48(18), 5235–5262.
   Google Scholar
• Ulrich, K.T. and Eppinger, S.D. (2016) Product Design and Development. McGraw-Hill, New York, NY.
   Google Scholar
• Van Laarhoven, P.J. and Aarts, E.H. (1987) Simulated annealing, in Simulated Annealing: Theory and Applications, pp. 7–15, Springer, New York, NY.
   Google Scholar
• Villahoz, J.J.L., del Olmo Martínez, R. and Arauzo, A.A. (2010) Price-setting combinatorial auctions for coordination and control of manufacturing multiagent systems: Updating prices methods, in Balanced Automation Systems for Future Manufacturing Networks, pp. 293–300, Springer, New York, NY.
   Google Scholar
• Voß, S. and Woodruff, D.L. (2006) Introduction to Computational Optimization Models for Production Planning in a Supply Chain, volume 240. Springer, New York, NY.
   Google Scholar
• Wu, L., De Matta, R. and Lowe, T.J. (2009) Updating a modular product: How to set time to market and component quality. IEEE Transactions on Engineering Management, 56(2), 298–310.
   Web of Science ®Google Scholar
• Wu, S.D., Erkoc, M. and Karabuk, S. (2005) Managing capacity in the high-tech industry: A review of literature. The Engineering Economist, 50(2), 125–158.
   Google Scholar