메뉴 건너뛰기




Volumn 133, Issue 1, 2011, Pages 377-384

A state space augmentation algorithm for the replenishment cycle inventory policy

Author keywords

Dynamic programming; Inventory control; Non stationary stochastic demand; Replenishment cycle policy; State space augmentation; State space filtering; State space relaxation

Indexed keywords

FILTERING PROCEDURES; INVENTORY CONTROL POLICIES; INVENTORY POLICIES; NONSTATIONARY; REDUCED-STATE; RELAXED STATE; REPLENISHMENT CYCLE; REPLENISHMENT CYCLE POLICY; SERVICE LEVEL CONSTRAINT; STATE SPACE; STATE SPACE RELAXATION; STOCHASTIC DEMAND;

EID: 79958191845     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2010.04.017     Document Type: Article
Times cited : (15)

References (26)
  • 1
    • 0019581159 scopus 로고
    • A procedure for production lot sizing with probabilistic dynamic demand
    • R.G. Askin A procedure for production lot sizing with probabilistic dynamic demand AIIE Transactions 13 2 1981 132 137
    • (1981) AIIE Transactions , vol.13 , Issue.2 , pp. 132-137
    • Askin, R.G.1
  • 2
    • 0003787146 scopus 로고
    • Princeton University Press Princeton, NJ
    • R.E. Bellman Dynamic Programming 1957 Princeton University Press Princeton, NJ
    • (1957) Dynamic Programming
    • Bellman, R.E.1
  • 3
    • 0002668750 scopus 로고
    • Lot sizing procedures for requirements planning systems: A framework for analysis
    • W.L. Berry Lot sizing procedures for requirements planning systems: a framework for analysis Production and Inventory Management Journal 13 2 1972 19 34
    • (1972) Production and Inventory Management Journal , vol.13 , Issue.2 , pp. 19-34
    • Berry, W.L.1
  • 4
    • 28044459377 scopus 로고    scopus 로고
    • Accelerated label setting algorithms for the elementary resource constrained shortest path problem
    • DOI 10.1016/j.orl.2004.11.011, PII S0167637705000040
    • N. Boland, J. Dethridge, and I. Dumitrescu Accelerated label setting algorithms for the elementary resource constrained shortest path problem Operations Research Letters 34 1 2006 58 68 (Pubitemid 41688319)
    • (2006) Operations Research Letters , vol.34 , Issue.1 , pp. 58-68
    • Boland, N.1    Dethridge, J.2    Dumitrescu, I.3
  • 5
    • 0001049772 scopus 로고
    • Strategies for the probabilistic lot-sizing problem with service-level constraints
    • J.H. Bookbinder, and J.Y. Tan Strategies for the probabilistic lot-sizing problem with service-level constraints Management Science 34 9 1988 1096 1108
    • (1988) Management Science , vol.34 , Issue.9 , pp. 1096-1108
    • Bookbinder, J.H.1    Tan, J.Y.2
  • 6
    • 0019572341 scopus 로고
    • State-space relaxation procedures for the computation of bounds to routing problems
    • N. Christofides, A. Mingozzi, and P. Toth State space relaxation procedures for the computation of bounds to routing problems Networks 11 2 1981 145 164 (Pubitemid 13506977)
    • (1981) Networks , vol.11 , Issue.2 , pp. 145-164
    • Christofides Nicos1    Mingozzi, A.2    Toth, P.3
  • 7
    • 0011502196 scopus 로고
    • Research Memorandum, FEW 521, Department of Economics, Tilburg University, Tilburg, The Netherlands
    • de Kok, A.G.; 1991. Basics of inventory management: part 2. The (R,S)-model. Research Memorandum, FEW 521, Department of Economics, Tilburg University, Tilburg, The Netherlands.
    • (1991) Basics of Inventory Management: Part 2. The (R,S)-model
    • De Kok, A.G.1
  • 8
    • 0031271989 scopus 로고    scopus 로고
    • Nervousness in inventory management: Comparison of basic control rules
    • PII S037722179600255X
    • A.G. de Kok, and K. Inderfurth Nervousness in inventory management: comparison of basic control rules European Journal of Operational Research 103 1 1997 55 82 (Pubitemid 127396730)
    • (1997) European Journal of Operational Research , vol.103 , Issue.1 , pp. 55-82
    • De Kok, T.1    Inderfurth, K.2
  • 12
    • 0031144368 scopus 로고    scopus 로고
    • Dynamic programming strategies for the traveling salesman problem with time window and precedence constraints
    • A. Mingozzi, L. Bianco, and S. Ricciardelli Dynamic programming strategies for travelling salesan problem with time windows and precedence constraints Operations Research 45 3 1997 365 377 (Pubitemid 127684715)
    • (1997) Operations Research , vol.45 , Issue.3 , pp. 365-377
    • Mingozzi, A.1    Bianco, L.2    Ricciardelli, S.3
  • 13
    • 38649093918 scopus 로고    scopus 로고
    • Augmenting the lot sizing order quantity when demand is probabilistic
    • DOI 10.1016/j.ejor.2007.03.049, PII S0377221707004377
    • I.N. Pujawan, and E.A. Silver Augmenting the lot sizing order quantity when demand is probabilistic European Journal of Operational Research 127 3 2008 705 722 (Pubitemid 351173468)
    • (2008) European Journal of Operational Research , vol.188 , Issue.3 , pp. 705-722
    • Pujawan, I.N.1    Silver, E.A.2
  • 14
    • 51349129806 scopus 로고    scopus 로고
    • New dynamic programming algorithms for the resource constrained elementary shortest path problem
    • G. Righini, and M. Salani New dynamic programming algorithms for the resource constrained elementary shortest path problem Networks 51 3 2008 155 170
    • (2008) Networks , vol.51 , Issue.3 , pp. 155-170
    • Righini, G.1    Salani, M.2
  • 15
    • 52949121426 scopus 로고    scopus 로고
    • A global chance-constraint for stochastic inventory systems under service level constraints
    • R. Rossi, S.A. Tarim, B. Hnich, and S. Prestwich A global chance-constraint for stochastic inventory systems under service level constraints Constraints 13 4 2008 490 517
    • (2008) Constraints , vol.13 , Issue.4 , pp. 490-517
    • Rossi, R.1    Tarim, S.A.2    Hnich, B.3    Prestwich, S.4
  • 16
    • 0004112038 scopus 로고
    • second ed. Addison-Wesley Longman Publishing Co.; Inc. Boston, MA, USA
    • R. Sedgewick Algorithms second ed. 1988 Addison-Wesley Longman Publishing Co.; Inc. Boston, MA, USA
    • (1988) Algorithms
    • Sedgewick, R.1
  • 17
    • 0018057838 scopus 로고
    • Inventory control under a probabilistic time-varying demand pattern
    • E.A. Silver Inventory control under a probabilistic time-varying demand pattern AIIE Transactions 10 4 1978 371 379
    • (1978) AIIE Transactions , vol.10 , Issue.4 , pp. 371-379
    • Silver, E.A.1
  • 19
    • 33745813950 scopus 로고    scopus 로고
    • Perspectives in supply chain risk management
    • DOI 10.1016/j.ijpe.2005.12.006, PII S0925527306000405
    • C.S. Tang Perpectives in supply chain risk management International Journal of Production Economics 103 2 2006 451 488 (Pubitemid 44038496)
    • (2006) International Journal of Production Economics , vol.103 , Issue.2 , pp. 451-488
    • Tang, C.S.1
  • 21
    • 62949169326 scopus 로고    scopus 로고
    • Cost-based filtering techniques for stochastic inventory control under service level constraints
    • S.A. Tarim, B. Hnich, R. Rossi, and S. Prestwich Cost-based filtering techniques for stochastic inventory control under service level constraints Constraints 14 2 2009 137 176
    • (2009) Constraints , vol.14 , Issue.2 , pp. 137-176
    • Tarim, S.A.1    Hnich, B.2    Rossi, R.3    Prestwich, S.4
  • 22
    • 0742266961 scopus 로고    scopus 로고
    • The stochastic dynamic production/inventory lot-sizing problem with service-level constraints
    • S.A. Tarim, and B.G. Kingsman The stochastic dynamic production/inventory lot-sizing problem with service-level constraints International Journal of Production Economics 88 1 2004 105 119
    • (2004) International Journal of Production Economics , vol.88 , Issue.1 , pp. 105-119
    • Tarim, S.A.1    Kingsman, B.G.2
  • 23
    • 33645738856 scopus 로고    scopus 로고
    • Stochastic constraint programming: A scenario-based approach
    • S.A. Tarim, S. Manandhar, and T. Walsh Stochastic constraint programming: a scenario-based approach Constraints 11 1 2006 53 80
    • (2006) Constraints , vol.11 , Issue.1 , pp. 53-80
    • Tarim, S.A.1    Manandhar, S.2    Walsh, T.3
  • 24
    • 40849133916 scopus 로고    scopus 로고
    • Constraint programming for computing non-stationary (R, S) inventory policies
    • DOI 10.1016/j.ejor.2006.11.048, PII S0377221707006728
    • S.A. Tarim, and B. Smith Constraint programming for computing non-stationary (R,S) inventory policies European Journal of Operational Research 189 3 2008 1004 1021 (Pubitemid 351400591)
    • (2008) European Journal of Operational Research , vol.189 , Issue.3 , pp. 1004-1021
    • Tarim, S.A.1    Smith, B.M.2
  • 25
    • 33847293780 scopus 로고    scopus 로고
    • On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints
    • H. Tempelmeier On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints European Journal of Operational Research 181 1 2007 184 194
    • (2007) European Journal of Operational Research , vol.181 , Issue.1 , pp. 184-194
    • Tempelmeier, H.1
  • 26
    • 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 3 1958 89 96
    • (1958) Management Science , vol.5 , Issue.3 , pp. 89-96
    • Wagner, H.M.1    Whitin, T.M.2


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