메뉴 건너뛰기




Volumn 61, Issue , 2003, Pages 305-313

Accurate calculation of deme sizes for a parallel genetic scheduling algorithm

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; GENETIC ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; SCHEDULING;

EID: 0141843560     PISSN: 13837575     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (1)

References (15)
  • 2
    • 0003320043 scopus 로고
    • Introduction to deterministic scheduling theory
    • New York, NY: John Wiley and Sons
    • Coffman, E., Introduction to Deterministic Scheduling Theory, Computer and Job-Shop Scheduling Theory, New York, NY: John Wiley and Sons, 1976.
    • (1976) Computer and Job-Shop Scheduling Theory
    • Coffman, E.1
  • 7
    • 0000510934 scopus 로고    scopus 로고
    • Genetic algorithms, noise, and the sizing of populations
    • Goldberg, D., Deb, K., and Clark, J., Genetic Algorithms, Noise, and the Sizing of Populations, Complex Systems, 6, 332-362.
    • Complex Systems , vol.6 , pp. 332-362
    • Goldberg, D.1    Deb, K.2    Clark, J.3
  • 9
    • 0016943203 scopus 로고
    • Exact and approximate algorithms for scheduling nonidentical processors
    • Horowitz, E. and Sahni, S., Exact and Approximate Algorithms for Scheduling Nonidentical Processors, Journal of the ACM, vol. 23, no. 2, 1976, 317-327.
    • (1976) Journal of the ACM , vol.23 , Issue.2 , pp. 317-327
    • Horowitz, E.1    Sahni, S.2
  • 12
    • 0141746410 scopus 로고    scopus 로고
    • Parallel genetic algorithms to find near optimal schedules for tasks on multiprocessor architectures
    • In Chalmers, a., Mirmehdi, M., and Muller, H. (Eds.); IOS Press
    • Moore, M., Parallel Genetic Algorithms to Find Near Optimal Schedules for Tasks on Multiprocessor Architectures, In Chalmers, a., Mirmehdi, M., and Muller, H. (Eds.) Communicating Process Architectures 2001, Concurrent Systems Engineering Series, IOS Press, vol. 59, 2001, pgs, 27-36.
    • (2001) Communicating Process Architectures 2001, Concurrent Systems Engineering Series , vol.59 , pp. 27-36
    • Moore, M.1


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