Title :
A genetic programming heuristic for the one-machine total tardiness problem
Author :
Dimopoulos, Christos ; Zalzala, Ali M S
Author_Institution :
Dept. of Autom. Control & Syst. Eng., Sheffield Univ., UK
Abstract :
Genetic programming has rarely been applied to manufacturing optimisation problems. In this report we investigate the potential use of genetic programming for the solution of the one-machine total tardiness problem. Combinations of dispatching rules are employed as an indirect way of representing permutations within a modified genetic programming framework. Hybridisation of genetic programming with local search techniques is also introduced, in an attempt to improve the quality of solutions. All the algorithms are tested on a large number of benchmark problems with different levels of tardiness and tightness of due dates
Keywords :
dispatching; evolutionary computation; heuristic programming; optimisation; scheduling; search problems; benchmark problems; dispatching rules; due date tardiness; due date tightness; genetic programming heuristic; local search techniques; manufacturing optimisation problems; modified genetic programming framework; one-machine total tardiness problem; permutations; Automatic control; Dispatching; Evolutionary computation; Genetic engineering; Genetic programming; Job shop scheduling; Manufacturing automation; Scheduling algorithm; Systems engineering and theory; Testing;
Conference_Titel :
Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-5536-9
DOI :
10.1109/CEC.1999.785549
