Genetic programming heuristics for multiple machine scheduling

Authors:
Domagoj Jakobovic;Leonardo Jelenkovic;Leo Budin
Affiliations:
University of Zagreb, Faculty of Electrical Engineering and Computing, Croatia;University of Zagreb, Faculty of Electrical Engineering and Computing, Croatia;University of Zagreb, Faculty of Electrical Engineering and Computing, Croatia
Venue:
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
Year:
2007

Citing 3
Cited 8

Genetic search methods in air traffic control

Computers and Operations Research
Holonic Job Shop Scheduling Using a Multiagent System

IEEE Intelligent Systems
Dynamic scheduling with genetic programming

EuroGP'06 Proceedings of the 9th European conference on Genetic Programming

A distributed evolutionary method to design scheduling policies for volunteer computing

Proceedings of the 5th conference on Computing frontiers
A distributed evolutionary method to design scheduling policies for volunteer computing

ACM SIGMETRICS Performance Evaluation Review
Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach

Proceedings of the 12th annual conference on Genetic and evolutionary computation
DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic

Journal of Heuristics
Evolving priority scheduling heuristics with genetic programming

Applied Soft Computing
Learning reusable initial solutions for multi-objective order acceptance and scheduling problems with genetic programming

EuroGP'13 Proceedings of the 16th European conference on Genetic Programming
Cloud engineering is Search Based Software Engineering too

Journal of Systems and Software
Genetic programming for evolving due-date assignment models in job shop environments

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a method for creating scheduling heuristics for parallel proportional machine scheduling environment and arbitrary performance criteria. Genetic programming is used to synthesize the priority function which, coupled with an appropriate meta-algorithm for a given environment, forms the priority scheduling heuristic. We show that the procedures derived in this way can perform similarly or better than existing algorithms. Additionally, this approach may be particularly useful for those combinations of scheduling environment and criteria for which there are no adequate scheduling algorithms.