메뉴 건너뛰기




Volumn 24, Issue 2, 1999, Pages 306-330

Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part I, the single-station case

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DIFFERENTIATION (CALCULUS); MATHEMATICAL PROGRAMMING; PROBLEM SOLVING; QUEUEING NETWORKS; SCHEDULING;

EID: 0344146619     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.24.2.306     Document Type: Article
Times cited : (13)

References (35)
  • 2
    • 0039907017 scopus 로고
    • The achievable region method in the optimal control of queueing systems; formulations, bounds and policies
    • Bertsimas, D. 1995. The achievable region method in the optimal control of queueing systems; formulations, bounds and policies. Queueing Syst and Appl. 21 337-389.
    • (1995) Queueing Syst and Appl. , vol.21 , pp. 337-389
    • Bertsimas, D.1
  • 3
    • 85038063712 scopus 로고
    • Restless bandits, linear programming relaxations and a primal-dual heuristic
    • To Appear in
    • _, J. Niño-Mora. 1994. Restless bandits, linear programming relaxations and a primal-dual heuristic. To appear in Oper. Res.
    • (1994) Oper. Res.
    • Niño-Mora, J.1
  • 4
    • 0030134077 scopus 로고    scopus 로고
    • Conservation laws, extended polymatroids and multi-armed bandit problems; a polyhedral approach to indexable systems
    • _, _. 1996. Conservation laws, extended polymatroids and multi-armed bandit problems; a polyhedral approach to indexable systems. Math. Oper. Res. 21 257-306.
    • (1996) Math. Oper. Res. , vol.21 , pp. 257-306
  • 5
    • 0344146620 scopus 로고    scopus 로고
    • Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part II, the multiple-station case
    • _, _. 1999. Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part II, the multiple-station case. Math. Oper. Res. 24(2).
    • (1999) Math. Oper. Res. , vol.24 , Issue.2
  • 6
    • 0002154450 scopus 로고
    • Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance
    • _, I. Paschalidis, J. Tsitsiklis. 1994. Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance. Ann. Appl. Probab. 4 43-75.
    • (1994) Ann. Appl. Probab. , vol.4 , pp. 43-75
    • Paschalidis, I.1    Tsitsiklis, J.2
  • 7
    • 0029504871 scopus 로고
    • Branching bandits and Klimov's problem: Achievable region and side constraints
    • _, _, _. 1995. Branching bandits and Klimov's problem: Achievable region and side constraints. IEEE Trans. Automat. Control 40 2063-2075.
    • (1995) IEEE Trans. Automat. Control , vol.40 , pp. 2063-2075
  • 9
    • 0001002417 scopus 로고
    • Workloads and waiting times in single-server systems with multiple customer classes
    • Boxma, O. J. 1989. Workloads and waiting times in single-server systems with multiple customer classes. Queueing Syst. 5 185-214.
    • (1989) Queueing Syst. , vol.5 , pp. 185-214
    • Boxma, O.J.1
  • 10
    • 85038064014 scopus 로고    scopus 로고
    • Static optimization of queueing systems
    • R. P. Agarwal, ed., World Scientific Publishing
    • _. 1995. Static optimization of queueing systems. R. P. Agarwal, ed., Recent Trends in Optimization Theory and Applications, World Scientific Publishing.
    • Recent Trends in Optimization Theory and Applications , vol.1995
  • 11
    • 0004836691 scopus 로고
    • Efficient visit frequencies for polling tables: Minimization of waiting cost
    • _, H. Levy, J. A. Weststrate. 1991. Efficient visit frequencies for polling tables: Minimization of waiting cost. Queueing Syst. 9 133-162.
    • (1991) Queueing Syst. , vol.9 , pp. 133-162
    • Levy, H.1    Weststrate, J.A.2
  • 12
    • 0001104312 scopus 로고
    • The output of a queueing system
    • Burke, P. J. 1956. The output of a queueing system. Oper. Res. 4 699-704.
    • (1956) Oper. Res. , vol.4 , pp. 699-704
    • Burke, P.J.1
  • 14
    • 0019013348 scopus 로고
    • A characterization of waiting time performance realizable by single server queues
    • Coffman, E. G., Jr., I. Mitrani. 1980. A characterization of waiting time performance realizable by single server queues. Oper. Res. 28 810-821.
    • (1980) Oper. Res. , vol.28 , pp. 810-821
    • Coffman, E.G.1    Mitrani, I.2
  • 15
  • 16
    • 0001480223 scopus 로고
    • Queues with periodic service and changeover time
    • Eisenberg, M. 1972. Queues with periodic service and changeover time. Oper. Res. 20 440-451.
    • (1972) Oper. Res. , vol.20 , pp. 440-451
    • Eisenberg, M.1
  • 17
    • 0024073120 scopus 로고
    • Characterization and optimization of achievable performance in general queueing systems
    • Federgruen, A., H. Groenevelt. 1988. Characterization and optimization of achievable performance in general queueing systems. Oper. Res. 36 733-741.
    • (1988) Oper. Res. , vol.36 , pp. 733-741
    • Federgruen, A.1    Groenevelt, H.2
  • 18
    • 0022130542 scopus 로고
    • Stochastic decompositions in the M/G/1 queue with generalized vacations
    • Fuhrmann, S. W., R. B. Cooper. 1985. Stochastic decompositions in the M/G/1 queue with generalized vacations. Oper. Res. 33 1117-1129.
    • (1985) Oper. Res. , vol.33 , pp. 1117-1129
    • Fuhrmann, S.W.1    Cooper, R.B.2
  • 20
    • 0344991135 scopus 로고
    • A production system with two job classes, changeover times and revisitation
    • Gupta, D., J. A. Buzacott. 1990. A production system with two job classes, changeover times and revisitation. Queueing Syst. 6 353-368.
    • (1990) Queueing Syst. , vol.6 , pp. 353-368
    • Gupta, D.1    Buzacott, J.A.2
  • 22
    • 0024068882 scopus 로고
    • The analysis of random polling systems
    • Kleinrock, L., H. Levy. 1988. The analysis of random polling systems. Oper. Res. 36 716-732.
    • (1988) Oper. Res. , vol.36 , pp. 716-732
    • Kleinrock, L.1    Levy, H.2
  • 23
    • 0001035326 scopus 로고
    • Time sharing service systems I
    • Klimov, G. P. 1974. Time sharing service systems I. Theory Probab. Appl. 19 532-551.
    • (1974) Theory Probab. Appl. , vol.19 , pp. 532-551
    • Klimov, G.P.1
  • 24
    • 0028494016 scopus 로고
    • Performance bounds for queueing networks and scheduling policies
    • Kumar, S., P. R. Kumar. 1994. Performance bounds for queueing networks and scheduling policies. IEEE Trans. Autom. Control 39 1600-1611.
    • (1994) IEEE Trans. Autom. Control , vol.39 , pp. 1600-1611
    • Kumar, S.1    Kumar, P.R.2
  • 25
    • 0025502587 scopus 로고
    • Polling systems: Applications, modeling, and optimization
    • Levy, H., M. Sidi. 1990. Polling systems: Applications, modeling, and optimization. IEEE Trans. Comm. 38 1750-1760.
    • (1990) IEEE Trans. Comm. , vol.38 , pp. 1750-1760
    • Levy, H.1    Sidi, M.2
  • 26
    • 0001154274 scopus 로고
    • Cones of matrices and set-functions and 0-1 optimization
    • Lovász, L., A. Schrijver. 1991. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1 166-190.
    • (1991) SIAM J. Optim. , vol.1 , pp. 166-190
    • Lovász, L.1    Schrijver, A.2
  • 29
    • 84966209651 scopus 로고
    • Integrability of expected increments and a related random change of time scale
    • Papangelou, F. 1972. Integrability of expected increments and a related random change of time scale. Trans. Amer. Math. Soc. 165 483-506.
    • (1972) Trans. Amer. Math. Soc. , vol.165 , pp. 483-506
    • Papangelou, F.1
  • 31
    • 0026861383 scopus 로고
    • Multiclass queueing systems: Polymatroidal structure and optimal scheduling control
    • Shanthikumar, J. G., D. D. Yao. 1992. Multiclass queueing systems: Polymatroidal structure and optimal scheduling control. Oper. Res. 40 S293-299.
    • (1992) Oper. Res. , vol.40
    • Shanthikumar, J.G.1    Yao, D.D.2
  • 32
    • 0000560502 scopus 로고
    • A queueing network with a single cyclically roving server
    • Sidi, M., H. Levy, S. W. Fuhrmann. 1992. A queueing network with a single cyclically roving server. Queueing Syst. 10 121-144.
    • (1992) Queueing Syst. , vol.10 , pp. 121-144
    • Sidi, M.1    Levy, H.2    Fuhrmann, S.W.3
  • 35
    • 0030106462 scopus 로고    scopus 로고
    • Semidefinite programming
    • Vandenberghe, L., S. Boyd. 1996. Semidefinite programming. SIAM Review 38 49-95.
    • (1996) SIAM Review , vol.38 , pp. 49-95
    • Vandenberghe, L.1    Boyd, S.2


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