Yu-yan Han

Industrial and Manufacturing Engineering · 2014–2019

A researcher in the Science corpus: 2 papers; trusts 7 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

Whom Yu-yan Han trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Rubén Ruiz
  2. D. V. Veldhuizen
  3. Fantahun M. Defersha
  4. Kalyanmoy Deb
  5. Quan-Ke Pan
  6. Gary B. Lamont
  7. Ming-Ying Chen
  8. Concepción Maroto
  9. Samir Agrawal
  10. Mehmet Fatih Tasgetiren

Who trusts Yu-yan Han overall

  1. Shanu Verma
  2. Millie Pant

Papers from Yu-yan Han's perspective

Ordered by how strongly the researchers Yu-yan Han trusts endorse each paper. Same corpus, a different order for every researcher.

  1. A fast and elitist multiobjective genetic algorithm: NSGA-II
  2. TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM
  3. Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems (IEEE Trans. Syst. Man Cybern. Part C)
  4. Genetic algorithm for the flexible job-shop scheduling problem (SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483))
  5. DE/EDA: A new evolutionary algorithm for global optimization (Information Sciences)
  6. An effective genetic algorithm for the flexible job-shop scheduling problem (Expert systems with applications)
  7. A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems (Computers & Operations Research)
  8. A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search
  9. On measuring multiobjective evolutionary algorithm performance (Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512))
  10. An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem (Computers & industrial engineering)

Their papers