Nhu Binh Ho

According to our database, Nhu Binh Ho authored at least 9 papers between 2004 and 2008.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2008

Solving Multiple-Objective Flexible Job Shop Problems by Evolution and Local Search.

Nhu Binh Ho, Joc Cing Tay

IEEE Trans. Syst. Man Cybern. Part C, 2008

Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems.

Joc Cing Tay, Nhu Binh Ho

Comput. Ind. Eng., 2008

2007

Designing Dispatching Rules to Minimize Total Tardiness.

Joc Cing Tay, Nhu Binh Ho

Proceedings of the Evolutionary Scheduling, 2007

Learnable evolutionary model for flexible job-shop scheduling

Nhu Binh Ho

PhD thesis, 2007

An effective architecture for learning and evolving flexible job-shop schedules.

Nhu Binh Ho, Joc Cing Tay, Edmund Ming-Kit Lai

Eur. J. Oper. Res., 2007

Using evolutionary computation and local search to solve multi-objective flexible job shop problems.

Nhu Binh Ho, Joc Cing Tay

Proceedings of the Genetic and Evolutionary Computation Conference, 2007

2005

Evolving dispatching rules for solving the flexible job-shop problem.

Nhu Binh Ho, Joc Cing Tay

Proceedings of the IEEE Congress on Evolutionary Computation, 2005

LEGA: an architecture for learning and evolving flexible job-shop schedules.

Nhu Binh Ho, Joc Cing Tay

Proceedings of the IEEE Congress on Evolutionary Computation, 2005

2004

GENACE: an efficient cultural algorithm for solving the flexible job-shop problem.

Nhu Binh Ho, Joc Cing Tay

Proceedings of the IEEE Congress on Evolutionary Computation, 2004