Skip to Main Content
This paper investigates the potential use of genetic programming hyper-heuristics for solution of the real single machine production problem. This approach operates on a search space of heuristics rather than directly on a search space of solutions. Genetic programming hyper-heuristics generate new heuristics from a set of potential heuristic components. Real data from production department of a metal industries are used in the experiments. Experimental results show genetic programming hyper-heuristics outperforms other heuristics including MRT, SPT, LPT, EDD, LDD, dan MON rules with respect to minimum tardiness and minimum flow time objectives. Further results on sensitivity to changes indicate that GPHH designs are robust. Based on experiments, GPHH outperforms six other benchmark heuristics with number of generations 50 and number of populations 50. Human designed heuristics are result of years of work by a number of experts, while GPHH automate the design of the heuristics. As the search process is automated, this would largely reduce the cost of having to create a new set of heuristics.