Kim Yeong-Dae

Yeong-Dae Kim

Information about the author Yeong-Dae Kim will soon be added to the site.
Found 35 papers in total
Minimizing total tardiness in permutation flowshops
Minimizing total tardiness in permutation flowshops
1995
We consider the permutation flowshop scheduling problem with the objective of...
Search heuristics for resource constrained project scheduling
Search heuristics for resource constrained project scheduling
1996
The paper develops a search procedure for project scheduling problems with multiple...
Simulated annealing and genetic algorithms for scheduling products with multi-level product structure
Simulated annealing and genetic algorithms for scheduling products with multi-level product structure
1996
The authors consider a short-term production scheduling problem in a manufacturing...
A heuristic for setting up a flexible assembly system
A heuristic for setting up a flexible assembly system
1995
We consider setup problems in flexible assembly systems (FASs) with an objective...
A backward approach in list scheduling algorithms for multi-machine tardiness problems
A backward approach in list scheduling algorithms for multi-machine tardiness problems
1995
List scheduling algorithms are commonly used for multi-machine scheduling problems,...
A new branch and bound algorithm for loading problems in flexible manufacturing systems
A new branch and bound algorithm for loading problems in flexible manufacturing systems
1994
Loading problems in flexible manufacturing systems involve assigning operations for...
Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
1994
The authors consider a single-machine scheduling problem with the objective of...
An iterative approach to system setup problems in flexible manufacturing systems
An iterative approach to system setup problems in flexible manufacturing systems
1992
System setup problems in flexible manufacturing systems deal with short-term planning...
A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops
A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops
1993
The paper considers the two-machine flowshop scheduling problem with the objective of...
Algorithms for a class of single-machine weighted tardiness and earliness problems
Algorithms for a class of single-machine weighted tardiness and earliness problems
1991
The authors address the problem of determining schedules for static, single-machine...
A comparison of dispatching rules for job shops with multiple identical jobs and alternative routeings
A comparison of dispatching rules for job shops with multiple identical jobs and alternative routeings
1990
In general job shop scheduling, n jobs have to be scheduled on m machines. The paper...
Papers per page: