메뉴 건너뛰기




Volumn 12, Issue 4, 2006, Pages 337-350

Scheduling with machine cost and rejection

Author keywords

Machine cost; Online algorithm; Rejection penalty; Scheduling

Indexed keywords

COMPETITIVE RATIO; MACHINE COST; ONLINE ALGORITHMS; REJECTION PENALTY;

EID: 33749618169     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-006-9003-y     Document Type: Article
Times cited : (44)

References (13)
  • 2
    • 8344241149 scopus 로고    scopus 로고
    • Better on-line algorithms for scheduling with machine cost
    • Dósa G, He Y (2004) Better on-line algorithms for scheduling with machine cost. SIAM J Comput 33:1035-1051
    • (2004) SIAM J Comput , vol.33 , pp. 1035-1051
    • Dósa, G.1    He, Y.2
  • 3
    • 27644440807 scopus 로고    scopus 로고
    • Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
    • Dósa G, He Y (2006) Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines. Comput 76(1):149-164
    • (2006) Comput , vol.76 , Issue.1 , pp. 149-164
    • Dósa, G.1    He, Y.2
  • 4
    • 21044439058 scopus 로고    scopus 로고
    • Approximation schemes for scheduling on uniformly related and identical parallel machines
    • Epstein L, Sgall J (2004) Approximation schemes for scheduling on uniformly related and identical parallel machines. Algorithmica 39:43-57
    • (2004) Algorithmica , vol.39 , pp. 43-57
    • Epstein, L.1    Sgall, J.2
  • 5
    • 84944813080 scopus 로고
    • Bounds for certain multiprocessor anomalies
    • Graham RL (1966) Bounds for certain multiprocessor anomalies. Bell Syst Techn J 45:1563-1581
    • (1966) Bell Syst Techn J , vol.45 , pp. 1563-1581
    • Graham, R.L.1
  • 6
    • 0042782765 scopus 로고    scopus 로고
    • On-line machine scheduling with rejection
    • He Y, Min X (2000) On-line machine scheduling with rejection. Comput 65:1-12
    • (2000) Comput , vol.65 , pp. 1-12
    • He, Y.1    Min, X.2
  • 8
    • 84958759169 scopus 로고    scopus 로고
    • Scheduling with machine cost
    • Proc. RANDOM-APPROX Conf Springer-Verlag
    • Imreh C, Noga J (1999) Scheduling with machine cost. In: Proc. RANDOM-APPROX Conf, lecture notes in computer science, vol. 1671, Springer-Verlag, pp 168-176
    • (1999) Lecture Notes in Computer Science , vol.1671 , pp. 168-176
    • Imreh, C.1    Noga, J.2
  • 9
    • 17644385525 scopus 로고    scopus 로고
    • Preemptive online algorithms for scheduling with machine cost
    • Jiang YW, He Y (2005) Preemptive online algorithms for scheduling with machine cost. Acta Informatica 41:315-240
    • (2005) Acta Informatica , vol.41 , pp. 315-240
    • Jiang, Y.W.1    He, Y.2
  • 10
    • 33749621247 scopus 로고    scopus 로고
    • On-line scheduling with machine cost and rejection
    • Nagy-György J, Imreh C (2006) On-line scheduling with machine cost and rejection. Working paper
    • (2006) Working Paper
    • Nagy-György, J.1    Imreh, C.2
  • 11
    • 0036568109 scopus 로고    scopus 로고
    • Single operation earliness-tardiness scheduling with machine activation costs
    • Panwalker S, Liman SD (2002) Single operation earliness-tardiness scheduling with machine activation costs. IIE Trans 34:509-513
    • (2002) IIE Trans , vol.34 , pp. 509-513
    • Panwalker, S.1    Liman, S.D.2
  • 12
    • 0002204085 scopus 로고
    • A statistical adversary for on-line algorithms
    • On-line algorithms, DIMACS, Series in Discrete Mathematics and Theoretical Computer Sc., AMS, Providence, RI New York
    • Raghavan P (1991) A statistical adversary for on-line algorithms. In: On-line algorithms, DIMACS, Series in Discrete Mathematics and Theoretical Computer Sc., AMS, Providence, RI/Assoc. for Comp. Mach. vol. 7, New York, pp. 79-83
    • (1991) Assoc. for Comp. Mach. , vol.7 , pp. 79-83
    • Raghavan, P.1
  • 13
    • 0034911863 scopus 로고    scopus 로고
    • Preemptive multiprocessor scheduling with rejection
    • Seiden S (2001) Preemptive multiprocessor scheduling with rejection. Theor Comput Sci 262:437-458
    • (2001) Theor Comput Sci , vol.262 , pp. 437-458
    • Seiden, S.1


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