H. L. Ong

According to our database, H. L. Ong authored at least 12 papers between 1996 and 2010.

Collaborative distances:

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

2010

A modified tabu search algorithm for cost-based job shop problem.

Z. C. Zhu, Kien Ming Ng, H. L. Ong

J. Oper. Res. Soc., 2010

2008

Two composite methods for soft drink distribution problem.

L. Zeng, H. L. Ong, Kien Ming Ng, S. B. Liu

Adv. Eng. Softw., 2008

2007

A generalized crossing local search method for solving vehicle routing problems.

L. Zeng, H. L. Ong, Kien Ming Ng

J. Oper. Res. Soc., 2007

2006

Heuristic algorithms for visiting the customers in a rolling schedule environment.

S. Y. Teng, H. L. Ong, H. C. Huang

OR Spectr., 2006

Solving the feeder bus network design problem by genetic algorithms and ant colony optimization.

S. N. Kuan, H. L. Ong, Kien Ming Ng

Adv. Eng. Softw., 2006

2005

An Assignment-Based Local Search Method for Solving Vehicle Routing Problems.

L. Zeng, H. L. Ong, Kien Ming Ng

Asia Pac. J. Oper. Res., 2005

A fast tabu search algorithm for the group shop scheduling problem.

S. Q. Liu, H. L. Ong, Kien Ming Ng

Adv. Eng. Softw., 2005

Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem.

S. Q. Liu, H. L. Ong, Kien Ming Ng

Adv. Eng. Softw., 2005

2004

An Integer L-shaped Algorithm for Time-Constrained Traveling Salesman Problem with Stochastic Travel and Service times.

S. Y. Teng, H. L. Ong, H. C. Huang

Asia Pac. J. Oper. Res., 2004

Metaheuristics for the Mixed shop Scheduling Problem.

S. Q. Liu, H. L. Ong

Asia Pac. J. Oper. Res., 2004

Applying Metaheuristics to Feeder Bus Network Design Problem.

S. N. Kuan, H. L. Ong, Kien Ming Ng

Asia Pac. J. Oper. Res., 2004

1996

Analysis of step-stress accelerated-life-test data: a new approach.

L. C. Tang, Y. S. Sun, T. N. Goh, H. L. Ong

IEEE Trans. Reliab., 1996