Evolutionary generation of dispatching rule sets for complex dynamic scheduling problems
Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet
Standard
in: International Journal of Production Economics, Jahrgang 145, Nr. 1, 09.2013, S. 67-77.
Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet
Harvard
APA
Vancouver
Bibtex
}
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 -