Kim Daecheol

Daecheol Kim

Information about the author Daecheol Kim will soon be added to the site.
Found 4 papers in total
Ant colony optimisation with parameterised search space for the job shop scheduling problem
Ant colony optimisation with parameterised search space for the job shop scheduling problem
2010
The job-shop scheduling problem (JSSP) is known to be NP-hard. Due to its complexity,...
A max-min ant colony optimization for undirected Steiner tree problem in graphs
A max-min ant colony optimization for undirected Steiner tree problem in graphs
2009
The undirected Steiner tree problem in graphs is known to be NP-hard. The objective of...
Parallel machine scheduling with earliness–tardiness penalties and additional resource constraints
Parallel machine scheduling with earliness–tardiness penalties and additional resource constraints
2003
This research considers the problem of scheduling jobs on parallel machines with...
Single machine earliness–tardiness scheduling with resource-dependent release dates
Single machine earliness–tardiness scheduling with resource-dependent release dates
2002
This paper deals with the single machine earliness and tardiness scheduling problem...
Papers per page: