메뉴 건너뛰기




Volumn 49, Issue 7, 2002, Pages 706-721

An index policy for a stochastic scheduling model with improving/deteriorating jobs

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; JOB ANALYSIS; MATHEMATICAL MODELS; PUBLIC POLICY; QUEUEING THEORY; SERVERS;

EID: 0036792912     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/nav.10036     Document Type: Article
Times cited : (24)

References (14)
  • 1
    • 0030134077 scopus 로고    scopus 로고
    • Conservation laws, extended polymatroids and multi-armed bandit problems: A polyhedral approach to indexable systems
    • D. Bertsimas and J. Niño-Mora, Conservation laws, extended polymatroids and multi-armed bandit problems: a polyhedral approach to indexable systems, Math Oper Res 21 (1996), 257-306.
    • (1996) Math Oper Res , vol.21 , pp. 257-306
    • Bertsimas, D.1    Niño-Mora, J.2
  • 2
    • 0000391518 scopus 로고
    • Dynamic priority rules for cyclic type queues
    • S. Browne and U. Yechiali, Dynamic priority rules for cyclic type queues, Adv Appl Probab 10 (1989), 432-450.
    • (1989) Adv Appl Probab , vol.10 , pp. 432-450
    • Browne, S.1    Yechiali, U.2
  • 5
    • 0000169010 scopus 로고
    • Bandit processes and dynamic allocation indices (with discussion)
    • J.C. Gittins, Bandit processes and dynamic allocation indices (with discussion), J Roy Stat Soc B41 (1979), 148-177.
    • (1979) J Roy Stat Soc , vol.B41 , pp. 148-177
    • Gittins, J.C.1
  • 7
    • 84989699786 scopus 로고
    • Single-machine scheduling of stochastic jobs subject to deterioration or delay
    • K.D. Glazebrook, Single-machine scheduling of stochastic jobs subject to deterioration or delay, Nav Res Logistics 39 (1992), 613-633.
    • (1992) Nav Res Logistics , vol.39 , pp. 613-633
    • Glazebrook, K.D.1
  • 8
    • 0023345261 scopus 로고
    • The multi-armed bandit problem: Decomposition and computation
    • M.N. Katehakis and A.F. Veinott, Jr., The multi-armed bandit problem: Decomposition and computation, Math Oper Res 12 (1987), 262-268.
    • (1987) Math Oper Res , vol.12 , pp. 262-268
    • Katehakis, M.N.1    Veinott A.F., Jr.2
  • 9
    • 17744388964 scopus 로고    scopus 로고
    • Restless bandits, partial conservation laws and indexability
    • J. Niño-Mora, Restless bandits, partial conservation laws and indexability, Adv Appl Probab 33 (2001), 76-98.
    • (2001) Adv Appl Probab , vol.33 , pp. 76-98
    • Niño-Mora, J.1
  • 11
    • 0030181541 scopus 로고    scopus 로고
    • Scheduling a make-to-stock queue: Index policies and hedging points
    • M. Veatch and L.M. Wein, Scheduling a make-to-stock queue: Index policies and hedging points, Oper Res 44 (1996), 634-647.
    • (1996) Oper Res , vol.44 , pp. 634-647
    • Veatch, M.1    Wein, L.M.2
  • 12
    • 0002327722 scopus 로고
    • On an index policy for restless bandits
    • R.R. Weber and G. Weiss, On an index policy for restless bandits, J Appl Probab 27 (1990), 637-648.
    • (1990) J Appl Probab , vol.27 , pp. 637-648
    • Weber, R.R.1    Weiss, G.2
  • 13
    • 0000397511 scopus 로고
    • On an index policy for restless bandits
    • R.R. Weber and G. Weiss, Addendum to "On an index policy for restless bandits," Adv Appl Probab 23 (1991), 429-430.
    • (1991) Adv Appl Probab , vol.23 , pp. 429-430
    • Weber, R.R.1    Weiss, G.2
  • 14
    • 0001043843 scopus 로고
    • Restless bandits: Activity allocation in a changing world
    • P. Whittle, Restless bandits: Activity allocation in a changing world, J Appl Probab A25 (1988), 287-298.
    • (1988) J Appl Probab , vol.A25 , pp. 287-298
    • Whittle, P.1


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