A genetic programming heuristic for the one-machine total tardiness problem

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.

[1]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[2]  Roger L. Wainwright,et al.  Solving facility layout problems using genetic programming , 1996 .

[3]  Hartmut Pohlheim,et al.  Generation of Structured Process Models Using Genetic Programming , 1996, Evolutionary Computing, AISB Workshop.

[4]  T. Ibaraki,et al.  A dynamic programming method for single machine scheduling , 1994 .

[5]  Stuart E. Dreyfus,et al.  Applied Dynamic Programming , 1965 .

[6]  Mohamed Ben-Daya,et al.  A simulated annealing approach for the one-machine mean tardiness scheduling problem , 1996 .

[7]  Ali M. S. Zalzala,et al.  Investigating the use of genetic programming for a classic one-machine scheduling problem , 2001 .

[8]  T. Fry,et al.  A Heuristic Solution Procedure to Minimize T on a Single Machine , 1989 .

[9]  Christos Koulamas,et al.  A heuristic for the single machine tardiness problem , 1993 .

[10]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[11]  J. D. Irwin,et al.  An Improved Method for Scheduling Independent Tasks , 1971 .

[12]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

[13]  Maurice Queyranne,et al.  The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..

[14]  B. J. Lageweg,et al.  Minimizing Total Costs in One-Machine Scheduling , 1975, Oper. Res..

[15]  A.M.S. Zalzala,et al.  Evolutionary Computation for Manufacturing Optimisation: Recent Developments , 1998 .

[16]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[17]  R M Russell,et al.  Evaluation of greedy, myopic and less-greedy heuristics for the single machine, total tardiness problem , 1997 .

[18]  R. M. Russell,et al.  A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness , 1992 .

[19]  Linus Schrage,et al.  Dynamic Programming Solution of Sequencing Problems with Precedence Constraints , 1978, Oper. Res..

[20]  Eugene L. Lawler.  On Scheduling Problems with Deferral Costs , 1964 .

[21]  Hamilton Emmons,et al.  One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..

[22]  Chris N. Potts,et al.  Single Machine Tardiness Sequencing Heuristics , 1991 .

[23]  V. Srinivasan.  A hybrid algorithm for the one machine sequencing problem to minimize total tardiness , 1971 .

[24]  Linus Schrage,et al.  Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks , 1978, Oper. Res..

[25]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

[26]  Marshall L. Fisher,et al.  A dual algorithm for the one-machine scheduling problem , 1976, Math. Program..