메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1711-1718

An adaptive approach for solving dynamic scheduling with time-varying number of tasks - Part II

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE APPROACH; CURRENT CHANGE; DAILY ACTIVITY; DEGREE OF CHANGE; DYNAMIC SCHEDULING; ENVIRONMENTAL CHANGE; INITIAL POPULATION; MULTI OBJECTIVE; NEW SOLUTIONS; NONDOMINATED SOLUTIONS; NONLINEAR PRINCIPAL COMPONENT ANALYSIS; OTHER ALGORITHMS; TIME CHANGE; TIME VARYING;

EID: 80051970896     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2011.5949821     Document Type: Conference Paper
Times cited : (12)

References (24)
  • 2
    • 0036530772 scopus 로고    scopus 로고
    • A fast and elitist multiobjective genetic algorithm: NSGA-II
    • DOI 10.1109/4235.996017, PII S1089778X02041012
    • K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, "A fast and elitist multiobjective genetic algorithm: NSGA-II", IEEE Trans. on Evolutionary Computation, vol. 6, no. 2, pp. 182-197, 2002. (Pubitemid 34555372)
    • (2002) IEEE Transactions on Evolutionary Computation , vol.6 , Issue.2 , pp. 182-197
    • Deb, K.1    Pratap, A.2    Agarwal, S.3    Meyarivan, T.4
  • 3
    • 68249099005 scopus 로고    scopus 로고
    • A survey of dynamic scheduling in manufacturing systems
    • D. Ouelhadj and S. Petrovic, "A survey of dynamic scheduling in manufacturing systems", Journal of Scheduling, vol. 12, no. 4, pp. 417-431, 2009.
    • (2009) Journal of Scheduling , vol.12 , Issue.4 , pp. 417-431
    • Ouelhadj, D.1    Petrovic, S.2
  • 7
    • 0003056605 scopus 로고
    • The algorithm selection problem
    • J. Rice, "The algorithm selection problem", Advances in Computers, vol. 15, pp. 65-118, 1976.
    • (1976) Advances in Computers , vol.15 , pp. 65-118
    • Rice, J.1
  • 8
    • 77955849498 scopus 로고    scopus 로고
    • Practical performance models of algorithms in evolutionary program induction and other domains
    • M. Graff and R. Poli, "Practical performance models of algorithms in evolutionary program induction and other domains", Artificial Intelligence, vol. 174, pp. 1254-1276, 2010.
    • (2010) Artificial Intelligence , vol.174 , pp. 1254-1276
    • Graff, M.1    Poli, R.2
  • 9
    • 68549128640 scopus 로고    scopus 로고
    • Empirical hardness models: Methodology and a case study on combinatorial auctions
    • K. Leyton-Brown, E. Nudelman, and Y. Shoham, "Empirical hardness models: Methodology and a case study on combinatorial auctions", Journal of the ACM, vol. 56, no. 4, 2009.
    • (2009) Journal of the ACM , vol.56 , Issue.4
    • Leyton-Brown, K.1    Nudelman, E.2    Shoham, Y.3
  • 10
    • 0003155122 scopus 로고
    • Fitness distance correlation as a measure of problem difficulty for genetic algorithms
    • L. J. Eshelman Ed., Morgan Kaufmann
    • T. Jones and S. Forrest, "Fitness distance correlation as a measure of problem difficulty for genetic algorithms", in L. J. Eshelman (Ed.), ICGA. Morgan Kaufmann, 1995, pp. 184-192.
    • (1995) ICGA , pp. 184-192
    • Jones, T.1    Forrest, S.2
  • 12
    • 34548079004 scopus 로고    scopus 로고
    • Fitness-proportional negative slope coefficient as a hardness measure for genetic algorithms
    • H. Lipson Ed. ACM, London, England, UK
    • R. Poli and L. Vanneschi, "Fitness-proportional negative slope coefficient as a hardness measure for genetic algorithms", in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2007). H. Lipson (Ed. ACM, London, England, UK, 2007, p. 13351342.
    • (2007) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2007) , pp. 13351342
    • Poli, R.1    Vanneschi, L.2
  • 13
    • 0037029331 scopus 로고    scopus 로고
    • On the analysis of the (1+1) evolutionary algorithm
    • S. Droste, T. Jansen, and I. Wegener, "On the analysis of the (1+1) evolutionary algorithm", Theoretical Computer Science, vol. 276 (12), pp. 51-81, 2002.
    • (2002) Theoretical Computer Science , vol.276 , Issue.12 , pp. 51-81
    • Droste, S.1    Jansen, T.2    Wegener, I.3
  • 14
    • 27644579712 scopus 로고    scopus 로고
    • On the choice of the offspring population size in evolutionary algorithms
    • DOI 10.1162/106365605774666921
    • T. Jansen, K. Jong, and I. Wegener, "On the choice of the offspring population size in evolutionary algorithms", Evolutionary Computation, vol. 13, no. 4, pp. 413-440, 2005. (Pubitemid 43955277)
    • (2005) Evolutionary Computation , vol.13 , Issue.4 , pp. 413-440
    • Jansen, T.1    De Jong, K.A.2    Wegener, I.3
  • 15
    • 33646077908 scopus 로고    scopus 로고
    • Runtime analysis of the (μ+1) EA on simple pseudo-Boolean functions
    • C. Witt, "Runtime analysis of the (mu + 1) ea on simple pseudo-boolean functions", Evolutionary Computation, vol. 14, no. 1, pp. 65-86, 2006. (Pubitemid 43955273)
    • (2006) Evolutionary Computation , vol.14 , Issue.1 , pp. 65-86
    • Witt, C.1
  • 19
    • 32444449633 scopus 로고    scopus 로고
    • Information landscapes
    • DOI 10.1145/1068009.1068248, GECCO 2005 - Genetic and Evolutionary Computation Conference
    • Y. Borenstein and R. Poli, "Information landscapes", in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2005). H.-G. Beyer, U.-M. OReilly (Eds.). ACM, Washington DC, USA, 2005, pp. 1515-1522. (Pubitemid 43226473)
    • (2005) GECCO 2005 - Genetic and Evolutionary Computation Conference , pp. 1515-1522
    • Borenstein, Y.1    Palio, R.2
  • 21
    • 7244238594 scopus 로고    scopus 로고
    • Nonlinear pca: A new hierarchical approach
    • Verleysen, m., ed.", in
    • M. Scholz and R. Vigario, "Nonlinear pca: a new hierarchical approach. in: Verleysen, m., ed." in Proceedings ESANN, 2002, pp. 439-444.
    • (2002) Proceedings ESANN , pp. 439-444
    • Scholz, M.1    Vigario, R.2
  • 22
    • 0034559432 scopus 로고    scopus 로고
    • Experimental evaluation of state-of-theart heuristics for the resource-constrained project scheduling problem
    • S. Hartmann and R. Kolisch, "Experimental evaluation of state-of-theart heuristics for the resource-constrained project scheduling problem", European Journal of Operational Research, vol. 127, no. 2, pp. 394-407, 2000.
    • (2000) European Journal of Operational Research , vol.127 , Issue.2 , pp. 394-407
    • Hartmann, S.1    Kolisch, R.2
  • 24
    • 51449101241 scopus 로고    scopus 로고
    • Integration of a holonic organizational control architecture and multiobjective evolutionary algorithm for flexible distributed scheduling
    • T. Yu, F. Tu, and K. R. Pattipati, "Integration of a holonic organizational control architecture and multiobjective evolutionary algorithm for flexible distributed scheduling", IEEE Transactions on Systems, Man, and Cybernetics, Part A, vol. 38, no. 5, pp. 1001-1017, 2008.
    • (2008) IEEE Transactions on Systems, Man, and Cybernetics, Part A , vol.38 , Issue.5 , pp. 1001-1017
    • Yu, T.1    Tu, F.2    Pattipati, K.R.3


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