메뉴 건너뛰기
Operations Research Letters
Volumn 33, Issue 2, 2005, Pages 127-133
An optimal rounding gives a better approximation for scheduling unrelated machines
Author keywords

Approximation algorithm; Rounding; Scheduling; Unrelated machines
Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; HEURISTIC METHODS; LINEAR PROGRAMMING; MATHEMATICAL OPERATORS; POLYNOMIAL APPROXIMATION; SCHEDULING; THEOREM PROVING;
EID: 9644301278     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.05.004     Document Type: Article
Times cited : (124)
References (11)
  • 1
    • 0019625166 scopus 로고
    • Algorithms for scheduling tasks on unrelated processors
    • E. Davis, J.M. Jaffe, Algorithms for scheduling tasks on unrelated processors, J. Assoc. Comput. Mach. 28 (1981) 721-736.
    • (1981) J. Assoc. Comput. Mach. , vol.28 , pp. 721-736
    • Davis, E.1    Jaffe, J.M.2
  • 2
    • 0021374487 scopus 로고
    • Tighter bound for the MULTIFITprocessor scheduling algorithm
    • D.K. Friesen, Tighter bound for the MULTIFITprocessor scheduling algorithm, SIAM J. Comput. 13 (1984) 170-181.
    • (1984) SIAM J. Comput. , vol.13 , pp. 170-181
    • Friesen, D.K.1
  • 3
    • 0001861741 scopus 로고
    • Bounds for MULTIFIT scheduling on uniform processors
    • D.K. Friesen, M.A. Langston, Bounds for MULTIFIT scheduling on uniform processors, SIAM J. Comput. 12 (1983) 60-70.
    • (1983) SIAM J. Comput. , vol.12 , pp. 60-70
    • Friesen, D.K.1    Langston, M.A.2
  • 4
    • 84944813080 scopus 로고
    • Bounds for certain multiprocessing anomalies
    • R.L. Graham, Bounds for certain multiprocessing anomalies, Bell. Syst. Tech. J. 45 (1966) 1563-1581.
    • (1966) Bell. Syst. Tech. J. , vol.45 , pp. 1563-1581
    • Graham, R.L.1
  • 5
    • 0024018137 scopus 로고
    • A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach
    • D.S. Hochbaum, D.B. Shmoys, A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach, SIAM J. Comput. 17 (1988) 539-551.
    • (1988) SIAM J. Comput. , vol.17 , pp. 539-551
    • Hochbaum, D.S.1    Shmoys, D.B.2
  • 6
    • 0016943203 scopus 로고
    • Exact and approximate algorithems for scheduling non-identical processors
    • E. Horowitz, S. Sahni, Exact and approximate algorithems for scheduling non-identical processors, J. Assoc. Comput. Mach. 23 (1976) 317-327.
    • (1976) J. Assoc. Comput. Mach. , vol.23 , pp. 317-327
    • Horowitz, E.1    Sahni, S.2
  • 7
    • 0000769475 scopus 로고
    • Heuristic algorithms for scheduling independent tasks on non-identical processors
    • O.H. Ibarra, C.E. Kim, Heuristic algorithms for scheduling independent tasks on non-identical processors, J. Assoc. Comput. Mach. 24 (1977) 280-289.
    • (1977) J. Assoc. Comput. Mach. , vol.24 , pp. 280-289
    • Ibarra, O.H.1    Kim, C.E.2
  • 8
    • 0000438412 scopus 로고
    • Approximation algorithms for scheduling unrelated parallel machines
    • J.K. Lenstra, D.B. Shmoys, E. Tardos, Approximation algorithms for scheduling unrelated parallel machines, Math. Programming 46 (1990) 259-271.
    • (1990) Math. Programming , vol.46 , pp. 259-271
    • Lenstra, J.K.1    Shmoys, D.B.2    Tardos, E.3
  • 9
    • 0020709337 scopus 로고
    • Analysis of a linear programming heuristic for scheduling unrelated parallel machines
    • C.N. Potts, Analysis of a linear programming heuristic for scheduling unrelated parallel machines, Discrete Appl. Math. 10 (1985) 155-164.
    • (1985) Discrete Appl. Math. , vol.10 , pp. 155-164
    • Potts, C.N.1
  • 10
    • 23044519507 scopus 로고    scopus 로고
    • Task distributions on multiprocessor systems
    • Springer, New York
    • E. Shchepin, N. Vakhania, Task distributions on multiprocessor systems, in: Lecture Notes in Computer Science (IFIP TCS), Vol. 1872, Springer, New York, 2000, pp. 112-125.
    • (2000) Lecture Notes in Computer Science (IFIP TCS) , vol.1872 , pp. 112-125
    • Shchepin, E.1    Vakhania, N.2
  • 11
    • 15344349285 scopus 로고
    • On the exact upper bound for the multifit processor scheduling algorithm
    • M. Yue, On the exact upper bound for the multifit processor scheduling algorithm, Ann. Oper. Res. 24 (1990) 233-259.
    • (1990) Ann. Oper. Res. , vol.24 , pp. 233-259
    • Yue, M.1

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