메뉴 건너뛰기




Volumn 131, Issue 2, 2011, Pages 535-544

Competition under capacitated dynamic lot-sizing with capacity acquisition

Author keywords

Approximation; Capacity optimization; Competition; Equilibrium; Game theory; Lot sizing

Indexed keywords

A-SPOTS; ACQUISITION COSTS; APPROXIMATION; CAPACITY COMPETITION; CAPACITY DEMANDS; CAPACITY OPTIMIZATION; CAPACITY PLANNING; CAPACITY RESTRICTION; COMPETING FIRMS; COMPETITION AND COOPERATION; COMPETITION MODEL; DYNAMIC LOT-SIZING; ECONOMIES OF SCALE; EQUILIBRIUM; FINITE PLANNING HORIZON; LOT SIZING; OPTIMAL DYNAMICS; PLANNING HORIZONS; TIME VARYING DEMAND; VARIABLE PRODUCTION;

EID: 79954424271     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2011.01.022     Document Type: Article
Times cited : (22)

References (31)
  • 1
    • 3543048065 scopus 로고    scopus 로고
    • Dynamic capacity acquisition and assignment under uncertainty
    • S. Ahmed, and R. Garcia Dynamic capacity acquisition and assignment under uncertainty Annals of Operations Research 124 14 2004 267 283
    • (2004) Annals of Operations Research , vol.124 , Issue.14 , pp. 267-283
    • Ahmed, S.1    Garcia, R.2
  • 2
    • 67349282740 scopus 로고    scopus 로고
    • Exact methods for single-item capacitated lot sizing problem with alternative machines and piece-wise linear production costs
    • A. Akbalik, and B. Penz Exact methods for single-item capacitated lot sizing problem with alternative machines and piece-wise linear production costs International Journal of Production Economics 119 2 2009 367 379
    • (2009) International Journal of Production Economics , vol.119 , Issue.2 , pp. 367-379
    • Akbalik, A.1    Penz, B.2
  • 4
    • 0035435909 scopus 로고    scopus 로고
    • Capacity acquisition, subcontracting, and lot sizing
    • A. Atamturk, and D.S. Hochbaum Capacity acquisition, subcontracting, and lot sizing Management Science 47 8 2001 1081 1100 (Pubitemid 34192807)
    • (2001) Management Science , vol.47 , Issue.8 , pp. 1081-1100
    • Atamturk, A.1    Hochbaum, D.S.2
  • 5
    • 0018153235 scopus 로고
    • An algorithm for the dynamic lot-size problem with time-varying production capacity constraints
    • K.R. Baker, P. Dixon, M.J. Magazine, and E.A. Silver An algorithm for the dynamic lot-size problem with time-varying production capacity constraints Management Science 24 16 1978 1710 1720 (Pubitemid 9444885)
    • (1978) Manage Sci , vol.24 , Issue.16 , pp. 1710-1720
    • Baker, K.R.1    Dixon, P.2    Magazine, M.J.3    Silver, E.A.4
  • 6
    • 0020194024 scopus 로고
    • Computational complexity of the capacitated lot size problem
    • G.R. Bitran, and H.H. Yanasse Computational complexity of the capacitated lot size problem Management Science 28 10 1982 1174 1186
    • (1982) Management Science , vol.28 , Issue.10 , pp. 1174-1186
    • Bitran, G.R.1    Yanasse, H.H.2
  • 7
    • 9644274216 scopus 로고    scopus 로고
    • Capacity competition of make-to-order firms
    • H. Chen, and Y.W. Wan Capacity competition of make-to-order firms Operations Research Letters 33 2 2005 187 194
    • (2005) Operations Research Letters , vol.33 , Issue.2 , pp. 187-194
    • Chen, H.1    Wan, Y.W.2
  • 8
    • 0000635282 scopus 로고
    • A new dynamic programming algorithm for the single item capacitated dynamic lot size model
    • H.D. Chen, D.W. Hearn, and C.Y. Lee A new dynamic programming algorithm for the single item capacitated dynamic lot size model Journal of Global Optimization 4 1994 285 300
    • (1994) Journal of Global Optimization , vol.4 , pp. 285-300
    • Chen, H.D.1    Hearn, D.W.2    Lee, C.Y.3
  • 11
    • 60349127277 scopus 로고    scopus 로고
    • Competition under time-varying demands and dynamic lot sizing costs
    • A. Federgruen, and J. Meissner Competition under time-varying demands and dynamic lot sizing costs Naval Research Logistics 67 1 2009 57 73
    • (2009) Naval Research Logistics , vol.67 , Issue.1 , pp. 57-73
    • Federgruen, A.1    Meissner, J.2
  • 12
    • 0026208005 scopus 로고
    • Simple forward algorithm to solve general dynamic lot sizing models with n periods in 0(n log n) or 0(n) time
    • A. Federgruen, and M. Tzur A simple forward algorithm to solve general dynamic lot sizing models with n periods in o(n logn) or o(n) time Management Science 37 8 1991 909 925 (Pubitemid 23585668)
    • (1991) Management Science , vol.37 , Issue.8 , pp. 909-925
    • Federgruen Awi1    Tzur Michal2
  • 13
    • 0001599465 scopus 로고
    • Optimal investment in production-flexible manufacturing capacity
    • C.H. Fine, and R.M. Freund Optimal investment in production-flexible manufacturing capacity Management Science 36 4 1990 446 449
    • (1990) Management Science , vol.36 , Issue.4 , pp. 446-449
    • Fine, C.H.1    Freund, R.M.2
  • 14
    • 0002144134 scopus 로고
    • Deterministic production planning with concave costs and capacity constraints
    • M. Florian, and M. Klein Deterministic production planning with concave costs and capacity constraints Management Science 18 1 1971 12 20
    • (1971) Management Science , vol.18 , Issue.1 , pp. 12-20
    • Florian, M.1    Klein, M.2
  • 16
    • 0033078588 scopus 로고    scopus 로고
    • Multi-resource investment strategies: Operational hedging under demand uncertainty
    • J.M. Harrison, and J.A. van Mieghem Multi-resource investment strategies: operational hedging under demand uncertainty European Journal of Operational Research 113 1 1999 17 29
    • (1999) European Journal of Operational Research , vol.113 , Issue.1 , pp. 17-29
    • Harrison, J.M.1    Van Mieghem, J.A.2
  • 17
    • 0025701550 scopus 로고
    • Efficient algorithm for the capacitated single item dynamic lot size problem
    • DOI 10.1016/0377-2217(90)90152-2
    • O. Kirca An efficient algorithm for the capacitated single item dynamic lot size problem European Journal of Operational Research 45 1 1990 15 24 (Pubitemid 20685038)
    • (1990) European Journal of Operational Research , vol.45 , Issue.1 , pp. 15-24
    • Kirca Omer1
  • 18
    • 0036508198 scopus 로고    scopus 로고
    • Flexible service capacity: Optimal investment and the impact of demand correlation
    • S. Netessine, G. Dobson, and R.A. Shumsky Flexible service capacity: optimal investment and the impact of demand correlation Operations Research 50 2 2002 375 388 (Pubitemid 34721186)
    • (2002) Operations Research , vol.50 , Issue.2 , pp. 375-388
    • Netessine, S.1    Dobson, G.2    Shumsky, R.A.3
  • 19
    • 0007166769 scopus 로고
    • Convex relaxations of (0,1)-quadratic programming
    • S. Poljak, and H. Wolkowicz Convex relaxations of (0,1)-quadratic programming Mathematics of Operations Research 20 3 1995 550 561
    • (1995) Mathematics of Operations Research , vol.20 , Issue.3 , pp. 550-561
    • Poljak, S.1    Wolkowicz, H.2
  • 20
    • 0034420664 scopus 로고    scopus 로고
    • Capacity and product market competition: Measuring market power in a 'puppy-dog' industry
    • L.H. Roller, and R. Sickles Capacity and product market competition: measuring market power in a 'puppy-dog' industry International Journal of Industrial Organization 18 6 2000 845 865
    • (2000) International Journal of Industrial Organization , vol.18 , Issue.6 , pp. 845-865
    • Roller, L.H.1    Sickles, R.2
  • 21
    • 0032094448 scopus 로고    scopus 로고
    • An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs
    • D.X. Shaw, and A.P.M. Wagelmans An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs Management Science 44 6 1998 831 838 (Pubitemid 128572653)
    • (1998) Management Science , vol.44 , Issue.6 , pp. 831-838
    • Shaw, D.X.1    Wagelmans, A.P.M.2
  • 23
    • 0018542824 scopus 로고
    • An O(n) algorithm for discrete n-point convex approximation with applications to continuous case
    • V.A. Ubhaya An O(n) algorithm for discrete n-point convex approximation with applications to continuous case Journal of Mathematical Analysis and Application 72 1979 338 354
    • (1979) Journal of Mathematical Analysis and Application , vol.72 , pp. 338-354
    • Ubhaya, V.A.1
  • 24
    • 0001491020 scopus 로고    scopus 로고
    • 3) algorithm for the economic lot-sizing problem with constant capacities
    • 3) algorithm for the economic lot-sizing problem with constant capacities Management Science 42 1 1996 142 150 (Pubitemid 126545091)
    • (1996) Management Science , vol.42 , Issue.1 , pp. 142-150
    • Van Hoesel, C.P.M.1    Wagelmans, A.P.M.2
  • 25
    • 0032136536 scopus 로고    scopus 로고
    • Investment strategies for flexible resources
    • J.A. van Mieghem Investment strategies for flexible resources Management Science 44 7 1998 1071 1078 (Pubitemid 128569652)
    • (1998) Management Science , vol.44 , Issue.8 , pp. 1071-1078
    • Van Mieghem, J.A.1
  • 26
    • 0032689596 scopus 로고    scopus 로고
    • Coordinating investment, production and subcontracting
    • J.A. van Mieghem Coordinating investment, production and subcontracting Management Science 45 7 1999 954 971
    • (1999) Management Science , vol.45 , Issue.7 , pp. 954-971
    • Van Mieghem, J.A.1
  • 27
    • 0036768955 scopus 로고    scopus 로고
    • Newsvendor networks: Inventory management and capacity investment with discretionary activities
    • J.A. van Mieghem, and N. Rudi Newsvendor networks: inventory management and capacity investment with discretionary activities Manufacturing & Service Operations Management 4 4 2002 313 335
    • (2002) Manufacturing & Service Operations Management , vol.4 , Issue.4 , pp. 313-335
    • Van Mieghem, J.A.1    Rudi, N.2
  • 28
    • 0003073250 scopus 로고
    • On the efficiency of Betrand and Cournot equilibria with product differentiation
    • X. Vives On the efficiency of Betrand and Cournot equilibria with product differentiation Journal of Economic Theory 36 1985 166 175
    • (1985) Journal of Economic Theory , vol.36 , pp. 166-175
    • Vives, X.1
  • 29
    • 44949269402 scopus 로고
    • Nash equalibrium with strategic complementarities
    • X. Vives Nash equalibrium with strategic complementarities Journal of Mathematical Economics 1990 305 321
    • (1990) Journal of Mathematical Economics , pp. 305-321
    • Vives, X.1
  • 30
    • 0000495984 scopus 로고
    • Economic lot sizing: An O(n logn)algorithm that runs in linear time in the WagnerWhitin case
    • A. Wagelmans, S. van Hoesel, and A. Kolen Economic lot sizing: an O(n logn)algorithm that runs in linear time in the WagnerWhitin case Operations Research 40 S1 1992 S145 S156
    • (1992) Operations Research , vol.40 , Issue.S1
    • Wagelmans, A.1    Van Hoesel, S.2    Kolen, A.3
  • 31
    • 0001962762 scopus 로고
    • Dynamic version of the economic lot size model
    • H.M. Wagner, and T.M. Whitin Dynamic version of the economic lot size model Management Science 5 1 1958 89 96
    • (1958) Management Science , vol.5 , Issue.1 , pp. 89-96
    • Wagner, H.M.1    Whitin, T.M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.