Investigating the use of genetic programming for a classic one-machine scheduling problem   [GP]

by

Dimopoulos, C. and Zalzala, A., M., S.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Advances in Engineering Software (Journal), 2001, p. 489-498
Keywords:genetic algorithms, genetic programming
Abstract:
Genetic programming [GP] has rarely been applied to manufacturing optimisation problems. In this paper the potential use of genetic programming [GP] for the solution of the one-machine total tardiness problem is investigated. Genetic programming [GP] is utilised for the evolution of scheduling policies in the form of dispatching rules. These rules are trained to cope with different levels of tardiness and tightness of due dates.
Notes:
<a href="mailto:cop97cd@sheffield.ac.uk">cop97cd@sheffield.ac.uk</a>
URL(s):Other format

Review item:

Mark as doublet (will be reviewed)

Print entry




BibTex:
@Article{Dimopoulos:2001:AES,
  author =       "C. Dimopoulos and A. M. S. Zalzala",
  title =        "Investigating the use of genetic programming for a
                 classic one-machine scheduling problem",
  journal =      "Advances in Engineering Software",
  volume =       "32",
  pages =        "489--498",
  year =         "2001",
  month =        "6",
  email =        "cop97cd@sheffield.ac.uk",
  keywords =     "genetic algorithms, genetic programming",
  URL =          "http://www.sciencedirect.com/science/article/B6V1P-42YFC02-7/1/6be8f2e3206dccb17801b7a7833a6299",
  abstract =     "Genetic programming has rarely been applied to
                 manufacturing optimisation problems. In this paper the
                 potential use of genetic programming for the solution
                 of the one-machine total tardiness problem is
                 investigated. Genetic programming is utilised for the
                 evolution of scheduling policies in the form of
                 dispatching rules. These rules are trained to cope with
                 different levels of tardiness and tightness of due
                 dates.",
}