메뉴 건너뛰기




Volumn 38, Issue 12, 2011, Pages 1836-1844

Interval scheduling on related machines

Author keywords

Competitive analysis; Computational complexity; Online algorithms; Scheduling

Indexed keywords

COMPETITIVE ALGORITHMS; COMPETITIVE ANALYSIS; COMPETITIVE RATIO; DETERMINISTIC ONLINE ALGORITHMS; DIFFERENT SPEED; INTERVAL SCHEDULING; LOWER BOUNDS; OFFLINE; ON-LINE ALGORITHMS; ONLINE VERSIONS; RELATED MACHINES; STRONGLY NP-HARD;

EID: 79955064614     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.03.001     Document Type: Article
Times cited : (24)

References (16)
  • 3
    • 0011350425 scopus 로고    scopus 로고
    • Interval scheduling on identical machines
    • K.I. Bouzina, and H. Emmons Interval scheduling on identical machines Journal of Global Optimization 9 34 1996 379 393 (Pubitemid 126714016)
    • (1996) Journal of Global Optimization , vol.9 , Issue.3-4 , pp. 379-393
    • Bouzina, K.I.1    Emmons, H.2
  • 6
    • 0028485488 scopus 로고
    • Online scheduling of jobs with fixed start and end times
    • G.J. Woeginger Online scheduling of jobs with fixed start and end times Theoretical Computer Science 130 1 1994 5 16
    • (1994) Theoretical Computer Science , vol.130 , Issue.1 , pp. 5-16
    • Woeginger, G.J.1
  • 7
    • 0012328903 scopus 로고    scopus 로고
    • Bounding the power of preemption in randomized scheduling
    • PII S0097539795283292
    • R. Canetti, and S. Irani Bounding the power of preemption in randomized scheduling SIAM Journal on Computing 27 4 1998 993 1015 (Pubitemid 128689441)
    • (1998) SIAM Journal on Computing , vol.27 , Issue.4 , pp. 993-1015
    • Canetti, R.1    Irani, S.2
  • 8
    • 0032058271 scopus 로고    scopus 로고
    • Randomized online interval scheduling
    • PII S0167637798000194
    • S.S. Seiden Randomized online interval scheduling Operations Research Letters 22 45 1998 171 177 (Pubitemid 128676375)
    • (1998) Operations Research Letters , vol.22 , Issue.4-5 , pp. 171-177
    • Seiden, S.S.1
  • 10
    • 3042829826 scopus 로고    scopus 로고
    • An improved randomized online algorithm for a weighted interval selection problem
    • H. Miyazawa, and T. Erlebach An improved randomized online algorithm for a weighted interval selection problem Journal of Scheduling 7 4 2004 293 311
    • (2004) Journal of Scheduling , vol.7 , Issue.4 , pp. 293-311
    • Miyazawa, H.1    Erlebach, T.2
  • 11
    • 49749134384 scopus 로고    scopus 로고
    • Online interval scheduling: Randomized and multiprocessor cases
    • S.P.Y. Fung, C.K. Poon, and F. Zheng Online interval scheduling: randomized and multiprocessor cases Journal of Combinatorial Optimization 16 3 2008 248 262
    • (2008) Journal of Combinatorial Optimization , vol.16 , Issue.3 , pp. 248-262
    • Fung, S.P.Y.1    Poon, C.K.2    Zheng, F.3
  • 13
    • 33750974188 scopus 로고    scopus 로고
    • Fixed interval scheduling: Models, applications, computational complexity and algorithms
    • DOI 10.1016/j.ejor.2006.01.049, PII S0377221706003559
    • M.Y. Kovalyov, C. Ng, and T.C.E. Cheng Fixed interval scheduling: models, applications, computational complexity and algorithms European Journal of Operations Research 178 2 2007 331 342 (Pubitemid 44750492)
    • (2007) European Journal of Operational Research , vol.178 , Issue.2 , pp. 331-342
    • Kovalyov, M.Y.1    Ng, C.T.2    Cheng, T.C.E.3
  • 16
    • 0018491099 scopus 로고
    • An optimal real-time algorithm for planar convex hulls
    • F.P. Preparata An optimal real-time algorithm for planar convex hulls Communications of the ACM 22 7 1979 402 405
    • (1979) Communications of the ACM , vol.22 , Issue.7 , pp. 402-405
    • Preparata, F.P.1


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