文章基本信息

标题：GA Based Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Uniform Parallel Machines
本地全文：下载
作者：P. Senthilkumar ; S. Narayanan
期刊名称：Intelligent Information Management
印刷版ISSN：2150-8194
电子版ISSN：2150-8208
出版年度：2011
卷号：3
期号：5
页码：204-214
DOI：10.4236/iim.2011.35025
出版社：Scientific Research Publishing
摘要：This paper considers the single machine scheduling problem with uniform parallel machines in which the objective is to minimize the makespan. Four different GA based heuristics are designed by taking different combinations of crossover methods, viz. single point crossover method and two point crossover method, and job allocation methods while generating initial population, viz. equal number of jobs allocation to machines and proportionate number of jobs allocation to machines based on machine speeds. A detailed experiment has been conducted by assuming three factors, viz. Problem size, crossover method and job allocation method on 135 problem sizes each with two replications generated randomly. Finally, it is suggested to use the GA based heuristic with single point crossover method, in which the proportionate number of jobs allocated to machines based on machine speeds.
关键词：Uniform Parallel Machines; Genetic Algorithm; Crossover Method; Job Allocation Method