메뉴 건너뛰기




Volumn 2, Issue , 2005, Pages 1340-1347

An efficient approach of simple and multirecombinated genetic algorithms for parallel machines scheduling

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SCHEDULING;

EID: 27144530613     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (2)

References (17)
  • 2
    • 0041691373 scopus 로고    scopus 로고
    • Scheduling algorithm based on evolutionary computing in identical parallel machine production line
    • M. Liu and C. Wu, "Scheduling algorithm based on evolutionary computing in identical parallel machine production line," Robotics and Computer-Integrated Manufacturing, no. 19, pp. 401-407, 2003.
    • (2003) Robotics and Computer-integrated Manufacturing , Issue.19 , pp. 401-407
    • Liu, M.1    Wu, C.2
  • 3
    • 2442615184 scopus 로고    scopus 로고
    • An improved hybrid genetic algorithm for the generalized assignment problem
    • Nicosia, Cyprus
    • H. Feltl and G. Raidl, "An improved hybrid genetic algorithm for the generalized assignment problem," in ACM Symposium on Applied Computing, (Nicosia, Cyprus), pp. 990-995, 2004.
    • (2004) ACM Symposium on Applied Computing , pp. 990-995
    • Feltl, H.1    Raidl, G.2
  • 4
    • 84942594986 scopus 로고    scopus 로고
    • Studs, seeds and immigrants in evolutionary algorithms for unrestricted parallel machine scheduling
    • (C. Lemaître, C. A. Reyes, and J. A. González, eds.), no. 3315 in Lecture Notes in Artificial Intelligence, (Heidelberg, Germany), Springer-Verlag, November
    • E. Ferretti, S. Esquivel, and R. Gallard, "Studs, seeds and immigrants in evolutionary algorithms for unrestricted parallel machine scheduling," in Advances in Artificial Intelligence - IBERAMIA 2004 (C. Lemaître, C. A. Reyes, and J. A. González, eds.), no. 3315 in Lecture Notes in Artificial Intelligence, (Heidelberg, Germany), pp. 174-184, Springer-Verlag, November 2004.
    • (2004) Advances in Artificial Intelligence - IBERAMIA 2004 , pp. 174-184
    • Ferretti, E.1    Esquivel, S.2    Gallard, R.3
  • 5
    • 0942291224 scopus 로고    scopus 로고
    • An indirect genetic algorithm for a nurse-scheduling problem
    • U. Aickelin and K. A. Dowsland, "An indirect genetic algorithm for a nurse-scheduling problem," Computers and Operations Research, vol. 31, no. 5, pp. 761-778, 2004.
    • (2004) Computers and Operations Research , vol.31 , Issue.5 , pp. 761-778
    • Aickelin, U.1    Dowsland, K.A.2
  • 10
    • 84901424052 scopus 로고    scopus 로고
    • Multiple crossovers between multiple parents to improve search in evolutionary algorithms
    • Washington, USA
    • S. Esquivel, A. Leiva, and R. Gallard, "Multiple crossovers between multiple parents to improve search in evolutionary algorithms," in Congress on Evolutionary Computation, (Washington, USA), pp. 1589-1594, 1999.
    • (1999) Congress on Evolutionary Computation , pp. 1589-1594
    • Esquivel, S.1    Leiva, A.2    Gallard, R.3
  • 14
    • 0342862183 scopus 로고    scopus 로고
    • Scheduling: Weighted Tardiness
    • J. Beasley, "Or library." http://people.brunel.ac.uk/mastjjb/ jeb/info.html. Scheduling: Weighted Tardiness.
    • Or Library
    • Beasley, J.1
  • 15
    • 0001234583 scopus 로고    scopus 로고
    • Local search heuristics for the single machine total weighted tardiness scheduling problem
    • H. A. J. Crauwels, C. N. Potts, and L. N. V. Wassenhove, "Local search heuristics for the single machine total weighted tardiness scheduling problem," Informs Journal on Computing, vol. 10, pp. 341-350, 1998.
    • (1998) Informs Journal on Computing , vol.10 , pp. 341-350
    • Crauwels, H.A.J.1    Potts, C.N.2    Wassenhove, L.N.V.3


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