Abstract
Dynamic Job Shop Scheduling Problem (DJSSP) is an NP-hard problem that has a great impact on production performance in practice. The design of Dispatching Rules (DRs) is very challenging because many shop attributes need to be investigated. Therefore, this paper proposes a Genetic Programming (GP) approach to generate DRs automatically for multi-objective DJSSP considering machine breakdowns. Computational experiments are conducted to compare the GP rule performance with 12 literature rules. The results indicate the superiority of the GP rule in minimizing mean flow time and makespan simultaneously. Finally, the best evolved rule is analyzed, and the significant attributes are extracted.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
