메뉴 건너뛰기
European Journal of Operational Research
Volumn 175, Issue 1, 2006, Pages 593-601
Inventory control with indivisible units of stock transfer
Author keywords

Backordering; Continuous review; Inventory; Periodic review; Production; Stochastic
Indexed keywords

FUNCTIONS; HEURISTIC METHODS; LINEAR SYSTEMS; OPTIMIZATION; PRODUCTION; RANDOM PROCESSES;
EID: 33749139110     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.04.043     Document Type: Article
Times cited : (3)
References (11)
  • 1
    • 0000888445 scopus 로고
    • (s, S) Policies under continuous review and discrete compound Poisson demands
    • Archibald B., and Silver E.A. (s, S) Policies under continuous review and discrete compound Poisson demands. Management Science 24 (1978) 899-908
    • (1978) Management Science , vol.24 , pp. 899-908
    • Archibald, B.1    Silver, E.A.2
  • 2
    • 0026897138 scopus 로고
    • An efficient algorithm for computing an optimal (r, Q) policy in continuous review stochastic inventory systems
    • Federgruen A., and Zheng Y.-S. An efficient algorithm for computing an optimal (r, Q) policy in continuous review stochastic inventory systems. Operations Research 40 (1992) 808-813
    • (1992) Operations Research , vol.40 , pp. 808-813
    • Federgruen, A.1    Zheng, Y.-S.2
  • 3
    • 0008916173 scopus 로고
    • Solutions to a class of discrete-time inventory problems
    • Morse P. Solutions to a class of discrete-time inventory problems. Operations Research 7 (1959) 67-78
    • (1959) Operations Research , vol.7 , pp. 67-78
    • Morse, P.1
  • 6
    • 0000470177 scopus 로고
    • The optimal inventory policy for batch ordering
    • Veinott A. The optimal inventory policy for batch ordering. Operations Research 13 (1965) 424-432
    • (1965) Operations Research , vol.13 , pp. 424-432
    • Veinott, A.1
  • 7
    • 0001370658 scopus 로고
    • Computing optimal (s, S) inventory policies
    • Veinott A., and Wagner H. Computing optimal (s, S) inventory policies. Management Science 11 (1965) 525-552
    • (1965) Management Science , vol.11 , pp. 525-552
    • Veinott, A.1    Wagner, H.2
  • 8
    • 0000443094 scopus 로고
    • A simple proof for the optimality of (s, S) policies for infinite-horizon inventory problems
    • Zheng Y.-S. A simple proof for the optimality of (s, S) policies for infinite-horizon inventory problems. Journal of Applied Probability 28 (1991) 802-810
    • (1991) Journal of Applied Probability , vol.28 , pp. 802-810
    • Zheng, Y.-S.1
  • 9
    • 0026842040 scopus 로고
    • Inventory policies with quantized ordering
    • Zheng Y.-S., and Chen F. Inventory policies with quantized ordering. Naval Research Logistics 39 (1992) 285-305
    • (1992) Naval Research Logistics , vol.39 , pp. 285-305
    • Zheng, Y.-S.1    Chen, F.2
  • 10
    • 0000232694 scopus 로고
    • Finding optimal (s, S) policies is about as simple as evaluating a single policy
    • Zheng Y.-S., and Federgruen A. Finding optimal (s, S) policies is about as simple as evaluating a single policy. Operations Research 39 (1991) 654-665
    • (1991) Operations Research , vol.39 , pp. 654-665
    • Zheng, Y.-S.1    Federgruen, A.2
  • 11
    • 0004590925 scopus 로고
    • Corrections to "Finding optimal (s, S) policies is about as simple as evaluating a single policy"
    • (See also )
    • (See also. Zheng Y.-S., and Federgruen A. Corrections to "Finding optimal (s, S) policies is about as simple as evaluating a single policy". Operations Research 40 (1992) 192 )
    • (1992) Operations Research , vol.40 , pp. 192
    • Zheng, Y.-S.1    Federgruen, A.2

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