SCOPUS 정보 검색 플랫폼

Volumn 22, Issue 4-5, 1998, Pages 171-177

Randomized online interval scheduling

Author keywords

Analysis of algorithms; Online algorithms; Scheduling

Indexed keywords

ALGORITHMS; FUNCTIONS; ONLINE SYSTEMS; PROBLEM SOLVING; PROCESS CONTROL; RANDOM PROCESSES; SCHEDULING;

DETERMINISTIC ALGORITHMS; ONLINE INTERVAL SCHEDULING;

JUST IN TIME PRODUCTION;

EID: 0032058271 PISSN: 01676377 EISSN: None Source Type: Journal
DOI: 10.1016/S0167-6377(98)00019-4 Document Type: Article

Times cited : (31)

References (11)

1
- 0026867292
- On the competetiveness of online realtime task scheduling
- S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, F. Wang, On the competetiveness of online realtime task scheduling, J. Real-time Systems 4(2) (1992) 125-144.
- (1992) J. Real-time Systems , vol.4 , Issue.2 , pp. 125-144
- Baruah, S.¹ Koren, G.² Mao, D.³ Mishra, B.⁴ Raghunathan, A.⁵ Rosier, L.⁶ Shasha, D.⁷ Wang, F.⁸

2
- 0028193049
- On the power of randomization in on-line algorithms
- S. Ben-David, A. Borodin, R. Karp, G. Tardos, A. Wigderson, On the power of randomization in on-line algorithms, Algorithmica 11 (1) (1994) 2-14.
- (1994) Algorithmica , vol.11 , Issue.1 , pp. 2-14
- Ben-David, S.¹ Borodin, A.² Karp, R.³ Tardos, G.⁴ Wigderson, A.⁵

3
- 3543146492
- Bounding the power of preemption in randomized scheduling
- R. Canetti, S. Irani, Bounding the power of preemption in randomized scheduling, in: Proc. 27 Ann. ACM Symp. on the Theory of Computing, 1995, pp. 606-615.
- (1995) Proc. 27 Ann. ACM Symp. on the Theory of Computing , pp. 606-615
- Canetti, R.¹ Irani, S.²

4
- 0002419537
- Note on scheduling intervals on-line
- U. Faigle, W. Nawijn, Note on scheduling intervals on-line, Discrete Appl. Math. 58 (1) (1995) 13-17.
- (1995) Discrete Appl. Math. , vol.58 , Issue.1 , pp. 13-17
- Faigle, U.¹ Nawijn, W.²

5
- 0004155526
- Addison-Wesley, Reading, MA
- R.L. Graham, D.E. Knuth, O. Patashnik, Concrete Mathematics, 2nd ed., Addison-Wesley, Reading, MA, 1994.
- (1994) Concrete Mathematics, 2nd Ed.
- Graham, R.L.¹ Knuth, D.E.² Patashnik, O.³

6
- 0023844490
- Competitive snoopy caching
- A. Karlin, M. Manasse, L. Rudolph, D. Sleator, Competitive snoopy caching, Algorithmica 3 (1) (1988) 79-119.
- (1988) Algorithmica , vol.3 , Issue.1 , pp. 79-119
- Karlin, A.¹ Manasse, M.² Rudolph, L.³ Sleator, D.⁴

7
- 0028255088
- Online interval scheduling
- R. Lipton, A. Tomkins, Online interval scheduling, in: Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 302-311.
- (1994) Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms , pp. 302-311
- Lipton, R.¹ Tomkins, A.²

8
- 0027307594
- Scheduling real-time disk transfers for continuous media applications
- D. Long, M. Thakur, Scheduling real-time disk transfers for continuous media applications, In Proc. 12th IEEE Sympos. on Mass Storage Systems, Putting all that Data to Work, 1993, pp. 227-232.
- (1993) Proc. 12th IEEE Sympos. on Mass Storage Systems, Putting All That Data to Work , pp. 227-232
- Long, D.¹ Thakur, M.²

9
- 0028195338
- Randomized competitive algorithms for the list update problem
- N. Reingold, J. Westbrook, D. Sleator, Randomized competitive algorithms for the list update problem, Algorithmica 11 (1) (1994) 15-32.
- (1994) Algorithmica , vol.11 , Issue.1 , pp. 15-32
- Reingold, N.¹ Westbrook, J.² Sleator, D.³

10
- 0022012946
- Amortized efficiency of list update and paging rules
- D. Sleator, R. Tarjan, Amortized efficiency of list update and paging rules, Commun. ACM 28 (2) (1985) 202-208.
- (1985) Commun. ACM , vol.28 , Issue.2 , pp. 202-208
- Sleator, D.¹ Tarjan, R.²

11
- 0028485488
- On-line scheduling of jobs with fixed start and end times
- G. Woeginger, On-line scheduling of jobs with fixed start and end times, Theoret. Comput. Sci. 130 (1) (1994) 5-16.
- (1994) Theoret. Comput. Sci. , vol.130 , Issue.1 , pp. 5-16
- Woeginger, G.¹

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