Extracting priority rules for dynamic multi-objective flexible job shop scheduling problems using gene expression programming

doi:10.1080/00207543.2018.1543964

Return

Extracting priority rules for dynamic multi-objective flexible job shop scheduling problems using gene expression programming

2018-11-09

PRE

Gürkan Öztürk *

Ozan Bahadir

Aydin Teymourifar

DOI：10.1080/00207543.2018.1543964

Original

Original request for help

Save

Abstract

En 中文

In this paper, two new approaches are proposed for extracting composite priority rules for scheduling problems. The suggested approaches use simulation and gene expression programming and are able to evolve specific priority rules for all dynamic scheduling problems in accordance with their features. The methods are based on the idea that both the proper design of the function and terminal sets and the structure of the gene expression programming approach significantly affect the results. In the first proposed approach, modified and operational features of the scheduling environment are added to the terminal set, and a multigenic system is used, whereas in the second approach, priority rules are used as automatically defined functions, which are combined with the cellular system for gene expression programming. A comparison shows that the second approach generates better results than the first; however, all of the extracted rules yield better results than the rules from the literature, especially for the defined multi-objective function consisting of makespan, mean lateness and mean flow time. The presented methods and the generated priority rules are robust and can be applied to all real and large-scale dynamic scheduling problems.

Keywords:

dynamic job shop scheduling

priority rules

simulation

gene expression programming

multi-objective optimisation

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.