메뉴 건너뛰기
Operations Research Letters
Volumn 33, Issue 3, 2005, Pages 301-304
When does the cμ rule apply to finite-population queueing systems?
Author keywords

Finite source queue; Machine repairman problem; c rule; preemption; Optimal scheduling; Priority assignment
Indexed keywords

COSTS; CUSTOMER SATISFACTION; MATHEMATICAL MODELS; POPULATION STATISTICS; PROBLEM SOLVING; SCHEDULING; SERVERS; THEOREM PROVING;
EID: 10044225466     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.05.009     Document Type: Article
Times cited : (15)
References (9)
  • 1
    • 0012872544 scopus 로고
    • On the optimal assignment of servers and a repairman
    • C. Derman, G.J. Lieberman, S.M. Ross, On the optimal assignment of servers and a repairman, J. Appl. Probab. 17 (1980) 577-581.
    • (1980) J. Appl. Probab. , vol.17 , pp. 577-581
    • Derman, C.1    Lieberman, G.J.2    Ross, S.M.3
  • 2
    • 10044294328 scopus 로고    scopus 로고
    • When does the cμ rule apply to finite-population queueing systems? The full version of this paper
    • Department of IE/MS, Northwestern University, Evanston, IL
    • S.M.R. Iravani, B. Kolfal, When does the cμ rule apply to finite-population queueing systems? The full version of this paper, Working paper, Department of IE/MS, Northwestern University, Evanston, IL, 2004.
    • (2004) Working Paper
    • Iravani, S.M.R.1    Kolfal, B.2
  • 3
    • 10044254977 scopus 로고    scopus 로고
    • Workforce agility in repair and maintenance environments
    • Department of IE/MS, Northwestern University, Evanston, IL
    • S.M.R. Iravani, V. Krishnamurthy, Workforce agility in repair and maintenance environments. Working paper, Department of IE/MS, Northwestern University, Evanston, IL, 2003.
    • (2003) Working Paper
    • Iravani, S.M.R.1    Krishnamurthy, V.2
  • 4
    • 0021522177 scopus 로고
    • Optimal repair allocation in a series system
    • M.N. Katehakis, C. Derman, Optimal repair allocation in a series system, Math. Oper. Res. 9 (1984) 615-623.
    • (1984) Math. Oper. Res. , vol.9 , pp. 615-623
    • Katehakis, M.N.1    Derman, C.2
  • 5
    • 5244291277 scopus 로고    scopus 로고
    • Scheduling a repairman in a finite source system
    • G. Koole, M. Vrijenhoek, Scheduling a repairman in a finite source system, Math. Methods Oper. Res. 44 (1996) 333-344.
    • (1996) Math. Methods Oper. Res. , vol.44 , pp. 333-344
    • Koole, G.1    Vrijenhoek, M.2
  • 6
    • 0021439353 scopus 로고
    • On the optimal policies of an exponential machine repair problem
    • T. Lehtonen, On the optimal policies of an exponential machine repair problem, Nav. Res. Logist. Q. 31 (1984) 173-181.
    • (1984) Nav. Res. Logist. Q. , vol.31 , pp. 173-181
    • Lehtonen, T.1
  • 7
    • 0012810070 scopus 로고
    • Dominant strategies in stochastic allocation and scheduling problems
    • M.A.H. Dempster (Ed.), D. Reidel, Dordrecht
    • P. Nash, R.R. Weber, Dominant strategies in stochastic allocation and scheduling problems, in: M.A.H. Dempster (Ed.), Deterministic and Stochastic Scheduling, D. Reidel, Dordrecht, 1982, pp. 343-353.
    • (1982) Deterministic and Stochastic Scheduling , pp. 343-353
    • Nash, P.1    Weber, R.R.2
  • 9
    • 0000834346 scopus 로고
    • Dynamic scheduling with convex delay costs: The generalized cμ rule
    • J.A. Van Mieghem, Dynamic scheduling with convex delay costs: the generalized cμ rule, Ann. Appl. Probab. 5 (1995) 808-833.
    • (1995) Ann. Appl. Probab. , vol.5 , pp. 808-833
    • Van Mieghem, J.A.1

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