Evolutionary generation of dispatching rule sets for complex dynamic scheduling problems

Publikation: Beiträge in ZeitschriftenZeitschriftenaufsätzeForschungbegutachtet

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, Jahrgang 145, Nr. 1, 09.2013, S. 67-77.

Publikation: Beiträge in ZeitschriftenZeitschriftenaufsätzeForschungbegutachtet

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 Sep;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 -

DOI

Zuletzt angesehen

Publikationen

  1. A discrete-time fractional order PI controller for a three phase synchronous motor using an optimal loop shaping approach
  2. Dynamic Lot Size Optimization with Reinforcement Learning
  3. A multi input sliding mode control for Peltier Cells using a cold-hot sliding surface
  4. A Control Scheme for PMSMs using Model Predictive Control and a Feedforward Action in the Presence of Saturated Inputs
  5. Constructs for Assessing Integrated Reports-Testing the Predictive Validity of a Taxonomy for Organization Size, Industry, and Performance
  6. Design and Control of an Inductive Power Transmission System with AC-AC Converter for a Constant Output Current
  7. Design and characterization of an EOG signal acquisition system based on the programming of saccadic movement routines
  8. Intersection tests for the cointegrating rank in dependent panel data
  9. Latent structure perceptron with feature induction for unrestricted coreference resolution
  10. On robustness properties in permanent magnet machine control by using decoupling controller
  11. Globally asymptotic output feedback tracking of robot manipulators with actuator constraints
  12. Vision-Based Deep Learning Algorithm for Detecting Potholes
  13. Construct Objectification and De-Objectification in Organization Theory
  14. Kinematic self-calibration of non-contact five-axis measuring machine using improved genetic algorithm.
  15. Methodologies for Noise and Gross Error Detection using Univariate Signal-Based Approaches in Industrial Application
  16. Algebraic combinatorics in mathematical chemistry. Methods and algorithms. I. Permutation groups and coherent (cellular) algebras.
  17. Springback prediction and reduction in deep drawing under influence of unloading modulus degradation
  18. Modelling tasks—The relation between linguistic skills, intra-mathematical skills, and context-related prior knowledge
  19. Diffusion-driven microstructure evolution in OpenCalphad
  20. Recurrence Quantification Analysis of Processes and Products of Discourse
  21. Exact and approximate inference for annotating graphs with structural SVMs
  22. Selecting and Adapting Methods for Analysis and Design in Value-Sensitive Digital Social Innovation Projects: Toward Design Principles
  23. Long-term memory predictors of adult language learning at the interface between syntactic form and meaning
  24. Interpreting Strings, Weaving Threads
  25. A model predictive control in Robotino and its implementation using ROS system
  26. Dynamically changing sequencing rules with reinforcement learning in a job shop system with stochastic influences
  27. A New Framework for Production Planning and Control to Support the Positioning in Fields of Tension Created by Opposing Logistic Objectives
  28. A Python toolbox for the numerical solution of the Maxey-Riley equation
  29. Joint entity and relation linking using EARL
  30. Human–learning–machines: introduction to a special section on how cybernetics and constructivism inspired new forms of learning
  31. A Wavelet Packet Tree Denoising Algorithm for Images of Atomic-Force Microscopy
  32. Introducing parametric uncertainty into a nonlinear friction model
  33. Finding Similar Movements in Positional Data Streams
  34. A change of values is in the air