Capacity Allocation and Scheduling in Supply Chains

Published Online:https://doi.org/10.1287/opre.1090.0806

References

  • Abad P. L. Optimal pricing and lot-sizing under conditions of perishability and partial backordering. Management Sci. (1996) 42(8):1093–1104LinkGoogle Scholar
  • Agnetis A., Hall N. G., Pacciarelli D. Supply chain scheduling: Sequence coordination. Discrete Appl. Math. (2006) 154(15):2044–2063CrossrefGoogle Scholar
  • AIS International (2009) . Accessed March 21, 2010, http://www.aisintl.net/Google Scholar
  • All Material Handling (2009) . Accessed September 2, http://www.allmaterialhandling.net/news.htmlGoogle Scholar
  • Anily S., Haviv M. The cost allocation problem for the first order interaction joint replenishment model. Oper. Res. (2007) 55(2):292–302LinkGoogle Scholar
  • Beach R., Muhlemann A. P., Price D. H. R., Paterson A., Sharp J. A. A review of manufacturing flexibility. Eur. J. Oper. Res. (2000) 122(1):41–57CrossrefGoogle Scholar
  • Bish E. K., Muriel A., Biller S. Managing flexible capacity in a make-to-order environment. Management Sci. (2005) 51(2):167–180LinkGoogle Scholar
  • Cachon G. P., Lariviere M. A. Capacity allocation using past sales: When to turn-and-earn. Management Sci. (1999a) 45(5):685–703LinkGoogle Scholar
  • Cachon G. P., Lariviere M. A. Capacity choice and allocation: Strategic behavior and supply chain performance. Management Sci. (1999b) 45(8):1091–1108LinkGoogle Scholar
  • Carr S., Duenyas I. Optimal admission control and sequencing in a make-to-stock/make-to-order production system. Oper. Res. (2000) 48(5):709–720LinkGoogle Scholar
  • Chakravarty A. K., Balakrishnan N. Real-time revision of order quantities with capacity constraints: A single period model. Production Oper. Management (2004) 13(2):171–185CrossrefGoogle Scholar
  • Chen X., Zhang J. A stochastic programming duality approach to inventory centralization games. Oper. Res. (2009a) 57(4):840–851LinkGoogle Scholar
  • Chen X., Zhang J. Duality approaches to economic lot-sizing games. (2009b) . Working paper, Department of Industrial and Enterprise Engineering, University of Illinois at Urbana–Champaign, ChampaignGoogle Scholar
  • Chen Z.-L. Integrated production and outbound distribution scheduling: Review and extensions. Oper. Res. (2010) 58(1):130–148LinkGoogle Scholar
  • Chen Z.-L., Hall N. G. Supply chain scheduling: Conflict and cooperation in assembly systems. Oper. Res. (2007) 55(6):1072–1089LinkGoogle Scholar
  • Chen Z.-L., Pundoor G. Order assignment and scheduling in a supply chain. Oper. Res. (2006) 54(3):555–572LinkGoogle Scholar
  • Chen Z.-L., Vairaktarakis G. L. Integrated scheduling of production and distribution operations. Management Sci. (2005) 51(4):614–628LinkGoogle Scholar
  • Cleanlink News Survey reveals thoughts on Jan/San buying groups. (2007) . Accessed March 21, 2010, http://www.alturasolutions.com/ProLinkSurveyonCleanLink.pdfGoogle Scholar
  • Dawande M., Geismar H. N., Hall N. G., Sriskandarajah C. Supply chain scheduling: Distribution systems. Production Oper. Management (2006) 15(2):243–261CrossrefGoogle Scholar
  • De Groote X. The flexibility of production processes: A general framework. Management Sci. (1994) 40(7):933–945LinkGoogle Scholar
  • Deng X., Papadimitriou C. H. On the complexity of cooperative solution concepts. Math. Oper. Res. (1994) 19(2):257–266LinkGoogle Scholar
  • Deshpande V., Schwarz L. B. Optimal capacity choice and allocation in decentralized supply chains. (2005) . Working paper, Krannert School of Management, Purdue University, West Lafayette, INGoogle Scholar
  • Durango-Cohen E. J., Yano C. A. Supplier commitment and production decisions under a forecast-commitment contract. Management Sci. (2006) 52(1):54–67LinkGoogle Scholar
  • EE Times TSMC puts customers on allocation. (2006) . May 9, http://www.eetimes.com/news/semi/showArticle.jhtml?articleID=187201641Google Scholar
  • Engels D. W., Karger D. R., Kolliopoulos S. G., Sengupta S., Uma R. N., Wein J. Techniques for scheduling with rejection. J. Algorithms (2003) 49(1):175–191CrossrefGoogle Scholar
  • Fang Q., Zhu S., Cai M., Deng X. On computational complexity of membership test in flow games and linear production games. Internat. J. Game Theory (2002) 31(1):39–45CrossrefGoogle Scholar
  • Fisher M. L. What is the right supply chain for your product? Harvard Bus. Rev. (1997) 75:28–40Google Scholar
  • Glasserman P. Allocating production capacity among multiple products. Oper. Res. (1996) 44(5):724–734LinkGoogle Scholar
  • Goldfarb D., Liu S. An O(n3L) primal-dual potential reduction algorithm for solving convex quadratic programs. Math. Programming (1993) 61(1–3):161–170CrossrefGoogle Scholar
  • Grieco J. Realist theory and the problem of international cooperation: Analysis with an amended prisoner's dilemma model. J. Politics (1988) 50(3):600–624CrossrefGoogle Scholar
  • Hall N. G., Liu Z. Capacity allocation and scheduling in supply chains. (2009) . Working paper, Fisher College of Business, the Ohio State University, ColumbusGoogle Scholar
  • Hall N. G., Posner M. E. Generating experimental data for computational testing with machine scheduling applications. Oper. Res. (2001) 49(6):854–865LinkGoogle Scholar
  • Hall N. G., Potts C. N. Supply chain scheduling: Batching and delivery. Oper. Res. (2003) 51(4):566–584LinkGoogle Scholar
  • Hartman B. C., Dror M., Shaked M. Cores of inventory centralization games. Games Econom. Behav. (2000) 31(1):26–49CrossrefGoogle Scholar
  • Iyer A. V., Deshpande V., Wu Z. P. A postponement model for demand management. Management Sci. (2003) 49(8):983–1002LinkGoogle Scholar
  • Kalai E., Zemel E. Generalized network problems yielding totally balanced games. Oper. Res. (1982) 30(5):998–1008LinkGoogle Scholar
  • Karabuk S., Wu S. D. Incentive schemes for semiconductor capacity allocation: A game theoretic analysis. Production Oper. Management (2005) 14(2):175–188CrossrefGoogle Scholar
  • Kasilingam R. G.Logistics and Transportation—Design and Planning (1999) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Google Scholar
  • Kellerer H., Pferschy U., Pisinger D.Knapsack Problems (2004) (Springer-Verlag, Berlin) CrossrefGoogle Scholar
  • Khermouch G. Triarc's smooth move—Triarc Beverage introduces new fruit drink. Brandweek (1998) June 22). http://findarticles.com/p/articles/mi_m0BDW/is_n25_v39/ai_20873390/pg_5Google Scholar
  • Laffont J. J.Fundamentals of Public Economics (1988) (MIT Press, Cambridge, MA) Google Scholar
  • Lee H. L., Padmanabhan V., Whang S. J. Information distortion in a supply chain: The bullwhip effect. Management Sci. (1997) 43(4):546–558LinkGoogle Scholar
  • Liu Z. Capacity allocation and rescheduling in supply chains. (2007) . Ph.D. dissertation, Fisher College of Business, the Ohio State University, ColumbusGoogle Scholar
  • Mallik S., Harker P. T. Coordinating supply chains with competition: Capacity allocation in semiconductor manufacturing. Eur. J. Oper. Res. (2004) 159(2):330–347CrossrefGoogle Scholar
  • Manhattan Associates Collaboration gateway: Join your key partners in creating more success. (2009) . Accessed March 21, 2010, http://www.manh.com/inventory_optimization/collaboration_gateway.htmlGoogle Scholar
  • Milner J. M., Kouvelis P. Order quantity and timing flexibility in supply chains: The role of demand characteristics. Management Sci. (2005) 51(6):970–985LinkGoogle Scholar
  • New South Construction Supply eNews (2008) May(Newsletter). http://www.newsouthsupply.com/newsletter/may08news.htmGoogle Scholar
  • Niyato D., Hossain E. A noncooperative game-theoretic framework for radio resource management in 4G heterogeneous wireless access networks. IEEE Trans. Mobile Comput. (2008) 7(3):332–345CrossrefGoogle Scholar
  • Owen G. On the core of linear production games. Math. Programming (1975) 9(1):358–370CrossrefGoogle Scholar
  • Peleg B., Sudhölter P.Introduction to the Theory of Cooperative Games (2003) (Kluwer, Boston) CrossrefGoogle Scholar
  • Pinedo M.Scheduling, Theory, Algorithms and Systems (2002) 2nd ed.(Prentice Hall, Englewood Cliffs, NJ) Google Scholar
  • Potts C. N., Kovalyov M. Y. Scheduling with batching: A review. Eur. J. Oper. Res. (2000) 120(2):228–249CrossrefGoogle Scholar
  • Samet D., Zemel E. On the core and dual set of linear programming games. Math. Oper. Res. (1984) 9(2):309–316LinkGoogle Scholar
  • Schönhage A., Paterson M., Pippenger N. Finding the median. J. Comput. System Sci. (1976) 13(2):184–199CrossrefGoogle Scholar
  • Sethi A. K., Sethi S. P. Flexibility in manufacturing: A survey. Internat. J. Flexible Manufacturing Systems (1990) 2(4):289–328CrossrefGoogle Scholar
  • Shapley L. S., Shubik M. The assignment game, 1: The core. Internat. J. Game Theory (1972) 1(1):111–130CrossrefGoogle Scholar
  • Smith W. E. Various optimizers for single-stage production. Naval Res. Logist. Quart. (1956) 3:59–66CrossrefGoogle Scholar
  • Trietsch D., Baker K. R. Basic techniques for lot streaming. Oper. Res. (1993) 41(6):1065–1076LinkGoogle Scholar
  • van den Heuvel W., Borm P. E. M., Hamers H. Economic lot-sizing games. Eur. J. Oper. Res. (2007) 176(2):1117–1130CrossrefGoogle Scholar
  • Zhang J. Cost allocation for joint replenishment models. Oper. Res. (2009) 57(1):146–156LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.