Evolutionary methods for the design of dispatching rules for complex and dynamic scheduling problems

Created by W.Langdon from gp-bibliography.bib Revision:1.8081

@PhdThesis{WRAP_THESIS_Pickardt_2013,

• author = "Christoph W. Pickardt",
• title = "Evolutionary methods for the design of dispatching rules for complex and dynamic scheduling problems",
• school = "Warwick Business School, University of Warwick",
• year = "2013",
• address = "UK",
• month = jul,
• keywords = "genetic algorithms, genetic programming, Production scheduling, Mathematical models, Evolutionary computation, Computer science, hyperheuristic",
• URL = "http://wrap.warwick.ac.uk/59757/1/WRAP_THESIS_Pickardt_2013.pdf",
• URL = "http://go.warwick.ac.uk/wrap",
• URL = "http://webcat.warwick.ac.uk/record=b2704739~S1",
• URL = "https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.595766",
• size = "173 pages",
• abstract = "Three methods, based on Evolutionary Algorithms (EAs), to support and automate the design of dispatching rules for complex and dynamic scheduling problems are proposed in this thesis. The first method employs an EA to search for problem instances on which a given dispatching rule performs badly. These instances can then be analysed to reveal weaknesses of the tested rule, thereby providing guidelines for the design of a better rule. The other two methods are hyper-heuristics, which employ an EA directly to generate effective dispatching rules. In particular, one hyper-heuristic is based on a specific type of EA, called Genetic Programming (GP), and generates a single rule from basic job and machine attributes, while the other generates a set of work centre-specific rules by selecting a (potentially) different rule for each work centre from a number of existing rules. Each of the three methods is applied to some complex and dynamic scheduling problem(s), and the resulting dispatching rules are tested against benchmark rules from the literature. In each case, the benchmark rules are shown to be outperformed by a rule (set) that results from the application of the respective method, which demonstrates the effectiveness of the proposed methods.",
• notes = "Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software T Technology > TS Manufactures

  Jasima simulation, hyper-heuristic

  Supervisor: Juergen Branke and Bo Chen",

}

Genetic Programming entries for Christoph Pickardt

Citations