 |
Kim, Sang Il (김상일)
Email:
Research Area:
Occupation: Samsung Electronics
2006 M.S. Graduation Thesis:
Search Heuristics for Parallel Machine Scheduling with Sequence-Dependent Setup and Ready times: Minimizing Total Tardiness
This thesis considers the problem of scheduling a set of independent jobs on parallel machines for the objective of minimizing total tardiness. Each job may have sequence-dependent setup and distinct ready times, i.e., the time at which the job is available for processing. These make the parallel machine scheduling problem considered in this thesis more difficult than the ordinary ones. Due to the complexity of the problem, two types of search heuristic, tabu search and simulated annealing, are suggested that incorporate new methods to generate the neighbourhood solutions. Three methods of obtaining the initial solutions are also suggested. Computational experiments are done on a number of randomly generated test problems, and the results show that the search heuristics suggested in this thesis outperform the existing one.
Lab Seminars:
|
