Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Genetic programming hyper-heuristic for solving dynamic production scheduling problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Abednego, L. ; Sch. of Electr. Eng. & Inf., Inst. Teknol. Bandung, Bandung, Indonesia ; Hendratmo, D.

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.

Published in:

Electrical Engineering and Informatics (ICEEI), 2011 International Conference on

Date of Conference:

17-19 July 2011