Wong C.K.

C.K. Wong

Information about the author C.K. Wong will soon be added to the site.
Found 11 papers in total
Linear-time-approximation algorithms for bin packing
Linear-time-approximation algorithms for bin packing
2000
Simchi–Levi proved that the famous bin packing algorithms FF and BF have an...
A lane-based optimization method for minimizing delay at isolated signal-controlled junctions
A lane-based optimization method for minimizing delay at isolated signal-controlled junctions
2003
The paper presents a lane-based optimization method for minimizing delay at isolated...
An experimental analysis of local minima to improve neighbourhood search
An experimental analysis of local minima to improve neighbourhood search
2003
The paper reports the results from a number of experiments on local search algorithms...
An effective quasi-human based heuristic for solving the rectangle packing problem
An effective quasi-human based heuristic for solving the rectangle packing problem
2002
In this paper, we introduce an effective deterministic heuristic, Less Flexibility...
Urban traffic flow prediction using a fuzzy-neural approach
Urban traffic flow prediction using a fuzzy-neural approach
2002
This paper develops a fuzzy-neural model (FNM) to predict the traffic flows in an...
Fast parallel heuristics for the job shop scheduling problem
Fast parallel heuristics for the job shop scheduling problem
2002
The paper is dealing with parallelized versions of simulated annealing-based...
Minimizing makespan on a single batch processing machine with nonidentical job sizes
Minimizing makespan on a single batch processing machine with nonidentical job sizes
2001
We deal with the problem of minimizing makespan on a single batch processing machine....
On-line algorithms for minimizing makespan on batch processing machines
On-line algorithms for minimizing makespan on batch processing machines
2001
We consider the problem of scheduling jobs on-line on batch processing machines with...
Time-varying minimum cost flow problems
Time-varying minimum cost flow problems
2001
In this paper, we study a minimum cost flow problem on a time-varying network. Let N (...
Time-varying shortest path problems with constraints
Time-varying shortest path problems with constraints
1997
We study a new version of the shortest path problem. Let G = (V, E) be a directed...
Two simulated annealing-based heuristics for the job shop scheduling problem
Two simulated annealing-based heuristics for the job shop scheduling problem
1999
In this paper, we present two simulated annealing-based algorithms for the classical,...
Papers per page: