Evolutionary generation of dispatching rule sets for complex dynamic scheduling problems

Research output: Journal contributionsJournal articlesResearchpeer-review

Standard

Evolutionary generation of dispatching rule sets for complex dynamic scheduling problems. / Pickardt, Christoph W.; Hildebrandt, Torsten; Branke, Jürgen et al.
In: International Journal of Production Economics, Vol. 145, No. 1, 09.2013, p. 67-77.

Research output: Journal contributionsJournal articlesResearchpeer-review

Harvard

APA

Vancouver

Pickardt CW, Hildebrandt T, Branke J, Heger J, Scholz-Reiter B. Evolutionary generation of dispatching rule sets for complex dynamic scheduling problems. International Journal of Production Economics. 2013 Sept;145(1):67-77. doi: 10.1016/j.ijpe.2012.10.016

Bibtex

@article{2e8d13078ebc435b9676ec092a569e83,
title = "Evolutionary generation of dispatching rule sets for complex dynamic scheduling problems",
abstract = "We propose a two-stage hyper-heuristic for the generation of a set of work centre-specific dispatching rules. The approach combines a genetic programming (GP) algorithm that evolves a composite rule from basic job attributes with an evolutionary algorithm (EA) that searches for a good assignment of rules to work centres. The hyper-heuristic is tested against its two components and rules from the literature on a complex dynamic job shop problem from semiconductor manufacturing. Results show that all three hyper-heuristics are able to generate (sets of) rules that achieve a significantly lower mean weighted tardiness than any of the benckmark rules. Moreover, the two-stage approach proves to outperform the GP and EA hyper-heuristic as it optimises on two different heuristic search spaces that appear to tap different optimisation potentials. The resulting rule sets are also robust to most changes in the operating conditions.",
keywords = "Dispatching rules, Evolutionary algorithms, Genetic programming, Hyper-heuristics, Production scheduling, Semiconductor manufacturing, Engineering",
author = "Pickardt, {Christoph W.} and Torsten Hildebrandt and J{\"u}rgen Branke and Jens Heger and Bernd Scholz-Reiter",
year = "2013",
month = sep,
doi = "10.1016/j.ijpe.2012.10.016",
language = "English",
volume = "145",
pages = "67--77",
journal = "International Journal of Production Economics",
issn = "0925-5273",
publisher = "Elsevier B.V.",
number = "1",

}

RIS

TY - JOUR

T1 - Evolutionary generation of dispatching rule sets for complex dynamic scheduling problems

AU - Pickardt, Christoph W.

AU - Hildebrandt, Torsten

AU - Branke, Jürgen

AU - Heger, Jens

AU - Scholz-Reiter, Bernd

PY - 2013/9

Y1 - 2013/9

N2 - We propose a two-stage hyper-heuristic for the generation of a set of work centre-specific dispatching rules. The approach combines a genetic programming (GP) algorithm that evolves a composite rule from basic job attributes with an evolutionary algorithm (EA) that searches for a good assignment of rules to work centres. The hyper-heuristic is tested against its two components and rules from the literature on a complex dynamic job shop problem from semiconductor manufacturing. Results show that all three hyper-heuristics are able to generate (sets of) rules that achieve a significantly lower mean weighted tardiness than any of the benckmark rules. Moreover, the two-stage approach proves to outperform the GP and EA hyper-heuristic as it optimises on two different heuristic search spaces that appear to tap different optimisation potentials. The resulting rule sets are also robust to most changes in the operating conditions.

AB - We propose a two-stage hyper-heuristic for the generation of a set of work centre-specific dispatching rules. The approach combines a genetic programming (GP) algorithm that evolves a composite rule from basic job attributes with an evolutionary algorithm (EA) that searches for a good assignment of rules to work centres. The hyper-heuristic is tested against its two components and rules from the literature on a complex dynamic job shop problem from semiconductor manufacturing. Results show that all three hyper-heuristics are able to generate (sets of) rules that achieve a significantly lower mean weighted tardiness than any of the benckmark rules. Moreover, the two-stage approach proves to outperform the GP and EA hyper-heuristic as it optimises on two different heuristic search spaces that appear to tap different optimisation potentials. The resulting rule sets are also robust to most changes in the operating conditions.

KW - Dispatching rules

KW - Evolutionary algorithms

KW - Genetic programming

KW - Hyper-heuristics

KW - Production scheduling

KW - Semiconductor manufacturing

KW - Engineering

UR - http://www.scopus.com/inward/record.url?scp=84880918018&partnerID=8YFLogxK

U2 - 10.1016/j.ijpe.2012.10.016

DO - 10.1016/j.ijpe.2012.10.016

M3 - Journal articles

AN - SCOPUS:84880918018

VL - 145

SP - 67

EP - 77

JO - International Journal of Production Economics

JF - International Journal of Production Economics

SN - 0925-5273

IS - 1

ER -

Recently viewed

Publications

  1. Digital Control of a Camless Engine Using Lyapunov Approach with Backward Euler Approximation
  2. Comparing Two Voltage Observers in a Sensorsystem using Repetitive Control
  3. A geometric algorithm for the output functional controllability in general manipulation systems and mechanisms
  4. Efficient and accurate ℓ p-norm multiple kernel learning
  5. The Influence of Note-taking on Mathematical Solution Processes while Working on Reality-Based Tasks
  6. Using protochirons for three-dimensional coding of certain chemical structures.
  7. On finding nonisomorphic connected subgraphs and distinct molecular substructures.
  8. Improving students’ science text comprehension through metacognitive self-regulation when applying learning strategies
  9. Dynamic environment modelling and prediction for autonomous systems
  10. Towards improved dispatching rules for complex shop floor scenarios - A genetic programming approach
  11. Data-Driven flood detection using neural networks
  12. Using augmented video to test in-car user experiences of context analog HUDs
  13. Data-driven and physics-based modelling of process behaviour and deposit geometry for friction surfacing
  14. Essentializing the binary self
  15. Overcoming Multi-legacy Application Challenges through Building Dynamic Capabilities for Low-Code Adoption
  16. Integration of Environmental Management Information Systems and ERP systems using Integration Platforms
  17. XOperator - Interconnecting the semantic web and instant messaging networks
  18. Reality-Based Tasks with Complex-Situations
  19. A geometric approach for controlling an electromagnetic actuator with the help of a linear Model Predictive Control
  20. Simple saturated PID control for fast transient of motion systems
  21. Faulty Process Detection Using Machine Learning Techniques
  22. Supporting the Development and Implementation of a Digitalization Strategy in SMEs through a Lightweight Architecture-based Method
  23. Identification of conductive fiber parameters with transcutaneous electrical nerve stimulation signal using RLS algorithm
  24. HAWK - hybrid question answering using linked data
  25. Knowledge-Enhanced Language Models Are Not Bias-Proof
  26. Advances in Dynamics, Optimization and Computation
  27. A general structural property in wavelet packets for detecting oscillation and noise components in signal analysis
  28. The effects of different on-line adaptive response time limits on speed and amount of learning in computer assisted instruction and intelligent tutoring
  29. Is too much help an obstacle? Effects of interactivity and cognitive style on learning with dynamic versus non-dynamic visualizations with narrative explanations
  30. Neural relational inference for disaster multimedia retrieval
  31. Mechanical performance prediction for friction riveting joints of dissimilar materials via machine learning
  32. The impact of goal focus, task type and group size on synchronous net-based collaborative learning discourses