Sequencing strategies and coordination issues in outsourcing and subcontracting operations

International Series in Operations Research and Management Science

Volumn 151, Issue , 2011, Pages 269-319

  Aydinliyim, Tolga ^a   Vairaktarakis, George L ^b  

^a UNIVERSITY OF OREGON   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84941424298     PISSN: 08848289     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4419-6485-4_12     Document Type: Chapter

References (95)

1. Agnetis A, Hall NG, Pacciarelli D (2006) Supply chain scheduling: sequence coordination. Discrete Appl Math, 154:2044-2063.
2. Ansberry C, Aeppel T (2003) Battling imports: surviving the onslaught; U.S. companies customize, rethink strategies to compete with products from abroad. The Wall Street Journal, New York, NY, October 6.
3. Anupindi R, Bassok Y (1999) Centralization of stocks: retailer vs. manufacturer. Manage Sci, 45(2):178-191.
4. Atamturk A, Hochbaum DS (2001) Capacity acquisition, subcontracting and lot sizing. Manage Sci, 47:1081-1100.
5. Aumann RJ (1974) Subjectivity and correlation in randomized strategies. J Mathe Econ 1:67-96.
6. Aydinliyim T (2007) Coordination and competition in outsourcing operations. Doctoral Dissertation. Case Western Reserve University, Cleveland, OH.
7. Aydinliyim T, Vairaktarakis GL (2010) Coordination of Outsourced Operations to Minimize Weighted Flow Time and Capacity Booking Costs. Manuf Serv Oper Manag 12(2):236-255.
8. Aydinliyim T, Vairaktarakis GL (2007) Subcontracting strategies with stochastic third-party capacity and tardiness penalty contracts. Working Paper, TM-817, Weatherhead School of Management, Case Western Reserve University.
9. Baker KR, Bertrand JWM (1982) A dynamic priority rule for scheduling against due dates. J Oper Manag 3:37-42.
10. Bernstein F, Federgruen A (2005) Decentralized supply chains with competing retailers under demand uncertainty. Manage Sci 51(1):18-29.
11. Bertrand JWM, Sridharan V (2001) A study of simple rules for subcontracting in make-to-order Manufacturing. Eur J Oper Res 128(3):509-531.
12. Biskup D, Simons D (1999) Game theoretic approaches to cost allocation in the dynamic total tardiness problem. IIE Trans 31(9):899-908.
13. Bitran GR, Tirupati D (1989) Hierarchical production planning. Working Paper, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA.
14. Borm P, Fiestras-Janeiro G, Hamers H, S anchez E, Voorneveld M (2002) On the convexity of games corresponding to sequencing situations with due dates. Eur J Oper Res 136:616-634.
15. Bukchin Y, Hanany E (2007) Decentralization cost in scheduling: a game-theoretic approach. Manuf Serv Oper Manag 9(3):263-275.
16. Cachon GP (2003) Supply chain coordination with contracts. In: Graves S, de Kok T, (eds) Handbooks in operations research and management science: supply chain management. North-Holland, Amsterdam, The Netherlands.
17. Cachon GP, Harker PT (2002) Competition and outsourcing with scale economies. Manag Sci 48(10):1314-1333.
18. Cachon GP, Lariviere M (1999) An equilibrium analysis of linear, proportional and uniform allocation of scarce capacity. IIE Trans 31:835-849.
19. Cachon GP, Lariviere M (2001) Contracting to assure supply: how to share demand forecasts in a supply chain. Manag Sci 47(5):629-646.
20. Cachon GP, Lariviere M (2005) Supply chain coordination with revenue sharing contracts: strengths and limitations. Manag Sci 51(1):30-44.
21. Cachon GP, Netessine S (2004) Game theoretic applications in supply chain analysis. In: Simchi-Levi D, Wu SD, Shen ZJ (eds) Supply chain analysis in e-business era, Kluwer, New York, NY.
22. Cai XQ, Vairaktarakis GL (2007) Cooperative strategies for manufacturing planning with negotiable third-party capacity. Working Paper, TM-820, Weatherhead School of Management, Case Western Reserve University, Submitted to Manag Sci.
23. Calleja P, Borm P, Hamers H, Klijn F, Slikker M (2002) On a new class of parallel sequencing situations and related games. Ann Oper Res, 109:263-276.
24. Calleja P, Estevez-Fernandez MA, Borm P, Hamers H (2004) Job scheduling, cooperation and control. CentER Discussion Papers, 2004-65, Tilburg University, Tilburg, The Netherlands.
25. Chen F (2003) Information sharing and supply chain coordination. In: Graves S, de Kok T, (eds) Handbooks in operations research and management science: supply chain management, NorthHolland, Amsterdam, The Netherlands.
26. Chen Q, Cai X (2006) Application of nash bargaining solution to a scheduling problem involving negotiation between two manufacturers. Working Paper, Systems Engineering and Engineering Department, Chinese University of Hong Kong, Shatin, Hong Kong SAR.
27. Chen ZL, Hall NG (2007) Supply chain scheduling: conflict and cooperation in assembly systems. Oper Res 55:1072-1089.
28. Chen ZL, Li CL (2008) Scheduling with subcontracting options. IIE Trans 40(12):1171-1184.
29. Chung D, Lee K, Shin K, Park J (2005) A new approach to job shop scheduling problems with due date constraints considering operation subcontracts. Int J Prod Econ 98:238-250.
30. Curiel I, Pederzoli G, Tijs S (1989) Sequencing games. Eur J oper Res 40:344-351.
31. Curiel I, Potters J, Rajendra Prasad V, Tijs S, Veltman B (1994) Sequencing and cooperation. Oper Res 42:566-568.
32. Curiel I, Hamers H, Klijn F (2002) Sequencing games: a survey. In: Borm P, Peters H (eds) Chapters in game theory: in honor of Stef Tijs. Kluwer Academic Publishers, Boston, pp. 27-50.
33. Dawande M, Agnetis A, Hall NG, Pacciarelli D (2006) Supply chain scheduling: distribution systems. Prod Oper Manag 15:243-261.
34. Day JS (1956) Subcontracting policy in the airframe industry. Graduate School of Business Administration, Harvard University, Boston, MA.
35. Du J, Leung J (1990) Minimizing total tardiness on one machine is NP-hard. Math Oper Res 15:483-495.
36. Emmons H (1969) One machine sequencing to minimize certain functions of job tardniess. Oper Res 17:701-715.
37. Gan X, Gu Y, Vairaktarakis GL, Cai X, Chen Q (2007) A scheduling problem with one producer and the bargaining counterpart with two producers. In: First International Symposium, ESCAPE 2007, Hangzhou, China, 7-9 April, Revised Selected Papers.
38. Ganesh A, Laevens K, Steinberg R (2007) Congestion pricing and noncooperative games in communication networks. Oper Res 55:430-438.
39. Gillies DB (1959) Solutions to general non-zero-sum games. In: Tucker AW, Luce RD (eds) Contributions to the theory of games IV (Ann Math Stud 40), Princeton University Press, Princeton, pp. 47-85.
40. Greaver MF (1999) Strategic outsourcing. AMA Publications, New York, NY.
41. Grosvenor F, Austin TA (2001) Cisco’s eHub initiative. Supply Chain Manag Rev, July/August, 28-35.
42. Hain R, Mitra M (2004) Simple sequencing problems with interdependent costs. Game Econ Behav 48:271-291.
43. Hall NG, Liu Z (2007) Capacity allocation and scheduling in supply chains. Working Paper, Fisher College of Business, The Ohio State University, Submitted for publication.
44. Hall NG, Liu Z (2008) Auctions for competitive capacity allocation and scheduling. Working Paper, Fisher College of Business, The Ohio State University, Submitted for publication.
45. Hall NG, Potts CN (2003) Supply chain scheduling: batching and delivery. Oper Res 51:566-584.
46. Hamers H, Borm P, Tijs S (1995) On games corresponding to sequencing situations with ready times. Math Program 70:1-13.
47. Hamers H, Klijn F, Suijs J (1999) On the balancedness of multimachine sequencing games, Euro J Oper Res 119:678-691.
48. Hamers H, Klijn F, van Velzen B (2002) On the convexity precedence sequencing games. CentER Discussion Papers 2002-112, Tilburg University, Tilburg, The Netherlands.
49. Heydenreich B, Muller R, Uetz M (2007) Games and mechanism design in machine scheduling -an introduction. Forthcoming in Prod Oper Manag.
50. Heydenreich B, Muller R, Uetz M (2007) Mechanism design for decentralized online machine scheduling. Working Paper. Maastricht University, Maastricht, The Netherlands.
51. Kamien MI, Li L (1990) Subcontracting, coordination, flexibility, and production smoothing in aggregate planning. Manag Sci 36(11):1352-1363.
52. Karabuk S, Wu DS (2005) Incentive schemes for semiconductor capacity allocation: a game theoretic analysis. Prod Oper Manag 14:175-188.
53. Katta AK, Sethuraman J (2006) Cooperation in queues. Working Paper, Department of Industrial Engineering and Operations Research, Columbia University, New York, NY.
54. Kutanoglu E, Wu DS (1999) On combinatorial auction and lagrangean relaxation for distributed resource scheduling. IIE Trans 31:813-826.
55. Lariviere M (1998) Supply chain contracting and co-ordination with stochastic demand. In: Tayur S, Ganeshan R, Magazine M (eds) ‘Quantitative models for supply chain management’. Kluwer, Dordrecht, The Netherlands.
56. Lariviere M, Porteus E (2001) Selling to the newsvendor: an analysis of price-only contracts. Manuf Serv Oper Manag 3(4):293-305.
57. Li L (1992) The role of inventory in delivery-time competition. Manag Sci 38(2):182-197.
58. Mallik S, Harker PT (2004) Coordinating supply chains with competition: capacity allocation in semiconductor manufacturing. Eur J Oper Res 159:330-347.
59. Maniquet F (2003) A characterization of the shapley value in queueing problems. J Econ Theor 109:90-103.
60. McAfee RP, McMillan J (1987) Auctions and bidding. J Econ Lit 25:699-738.
61. Miller T (2002) Hierarchical operations and supply chain planning. Springer, New York, NY.
62. Moore JM (1968) An n job one machine sequencing algorithm for minimizing the number of late jobs, Management Science 18(1):102-109.
63. Nagarajan M, Sosi Jc (2008) Game-theoretic analysis of cooperation among supply chain agents Review and Extension. Eur J Oper Res 187(3):719-745.
64. Nash JF (1950) The bargaining problem. Econometrica 18:155-162.
65. Nash JF (1951) Non-cooperative games. Ann Math 54:286-295.
66. Papadimitriou C (2001) Algorithms, games, and the Internet Proc 33rd Annual ACM Sympos Theor Comput. Association for Computing Machinery, Hersonissos, Greece, 749-753.
67. Pasternack B (1985) Optimal pricing and returns policies for perishable commodities. Mark Sci 4(2):166-176.
68. Pinedo M (2002) Scheduling: theory, algorithms and systems. Prentice Hall, Englewood Cliffs, NJ.
69. Potts CN, van Wassenhove LN (1982) A decomposition algorithm for the single machine total tardiness problem. Oper Res Lett 1:177-181.
70. Qi X (2007) Outsourcing and production scheduling for a two-stage flow shop. Working Paper, Hong Kong University of Science and Technology, Kowloon, Hong Kong SAR, PROC.
71. Qi X (2008) Coordinated logistics scheduling for in-house production and outsourcing. IEEE Trans Autom Sci Eng 5(1):188-192.
72. Raghu TS, Rajendran C (1993) An efficient dynamic dispatching rule for scheduling in a job shop. Int J Prod Econ 32:301-313.
73. Reeves DM, Wellman MP, MacKie-Maosn JK, Osepayshvili A (2005) Exploring Bidding Strategies for Market Based Scheduling. Decis Support Syst 39:67-85.
74. Rosenthal RW (1973) A class of games possessing pure-strategy nash equilibria. Int J Game Theory 2:65-67.
75. Sandholm WH (2002) Evolutionary implementation and congestion pricing. Rev Econ Stud 69:667-689.
76. Schrage L, Baker KR (1978) Dynamic programming solution of sequencing problems with precedence constraints. Oper Res 26:444-449.
77. Schulz AS, Uhan NA (2007) Encouraging cooperation in sharing supermodular costs. Working Paper, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA.
78. Shapley LS (1953) A value for n-Person games. In Kuhn HW, Tucker TW (eds) Contributions to the theory of games II. Annals of Mathematics Study. Princeton, New Jersey: Princeton University Press, 28:307-317.
79. Shapley L (1971) Cores of convex games. Int J Game Theor 1:11-26.
80. Shen W, Hao Q, Yoon HJ, Norrie DH (2006) Applications of agent-based systems in intelligent manufacturing: an updated review. Adv Eng Informat 20:415-431.
81. Slikker M (2006) Relaxed sequencing games have a nonempty core. Nav Res Logist 53:235-242.
82. Smith WE (1956) Various optimizers for single stage production. Nav Res Logist 3(1):59-66.
83. Swaminathan JM, Tayur SR (2003) Tactical planning models for supply chain management. In: Graves S, de Kok T (eds) Handbooks in operations research and management science: supply chain management. North-Holland, Amsterdam, The Netherlands.
84. Tan B (2004) Subcontracting with availability guarantees: production control and capacity decisions. IIE Trans 36:711-724.
85. Tan B, Gershwin SB (2004) Production and subcontracting strategies for manufacturers with limited capacity and volatile demand. Ann Oper Res 125:205-232.
86. Taylor T (2002) Coordination under channel rebates with sales effort. Manag Sci 48(8):992-1007.
87. Thomas DJ, Griffin PM (1996) Coordinated supply chain managament, Eur J Oper Res 94(1):1-15.
88. Tijs S, Parthasarathy T, Potters J, Prasad VR (1984) Permutation games: another class of totally balanced games. OR Spektrum, 6:119-123.
89. Tsay A (1999) Quantity-flexibility contract and supplier-customer incentives. Manag Sci 45(10): 1339-1358.
90. Vairaktarakis GL (2008) Non-cooperative outsourcing games. Working Paper, TM-822, Weather-head School of Managament, Case Western Reserve University. Submitted to Manuf Serv Oper Manag.
91. Vairaktarakis GL, Aydinliyim T (2007) Competition vs. centralization in subcontracting operations. Working Paper, TM-819, Weatherhead School of Managament, Case Western Reserve University. Submitted to Oper Res.
92. Van Mieghem JA (1999) Coordinating investment, production and subcontracting. Manag Sci 45(7):954-971.
93. van Velzen B, Hamers H (2003) On the Balancedness of Relaxed Sequencing Games. Math Meth Oper Res 57:287-297.
94. Yu Y, Benjaafar S, Gerchak Y (2007) Capacity pooling and cost sharing among independent firms in the presence of congestion. Working Paper, Department of Mechanical Engineering, University of Minnesota, Minneapolis, MN, Submitted for publication.
95. Wellman MP, Walsh WE, Wurman PR, MacKie-Mason JK (2001) Auction protocols for decentralized scheduling. Game Econ Behav 35:271-303.