scholarly journals A Meta-Model-Based Multi-Objective Evolutionary Approach to Robust Job Shop Scheduling

Mathematics ◽  
2019 ◽  
Vol 7 (6) ◽  
pp. 529 ◽  
Author(s):  
Zigao Wu ◽  
Shaohua Yu ◽  
Tiancheng Li

In the real-world manufacturing system, various uncertain events can occur and disrupt the normal production activities. This paper addresses the multi-objective job shop scheduling problem with random machine breakdowns. As the key of our approach, the robustness of a schedule is considered jointly with the makespan and is defined as expected makespan delay, for which a meta-model is designed by using a data-driven response surface method. Correspondingly, a multi-objective evolutionary algorithm (MOEA) is proposed based on the meta-model to solve the multi-objective optimization problem. Extensive experiments based on the job shop benchmark problems are conducted. The results demonstrate that the Pareto solution sets of the MOEA are much better in both convergence and diversity than those of the algorithms based on the existing slack-based surrogate measures. The MOEA is also compared with the algorithm based on Monte Carlo approximation, showing that their Pareto solution sets are close to each other while the MOEA is much more computationally efficient.

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Hongjing Wei ◽  
Shaobo Li ◽  
Huafeng Quan ◽  
Dacheng Liu ◽  
Shu Rao ◽  
...  

2020 ◽  
Author(s):  
Binzi Xu ◽  
Yi Mei ◽  
Yan Wang ◽  
Zhicheng Ji ◽  
Mengjie Zhang

Dynamic Flexible Job Shop Scheduling (DFJSS) is an important and challenging problem, and can have multiple conflicting objectives. Genetic Programming Hyper-Heuristic (GPHH) is a promising approach to fast respond to the dynamic and unpredictable events in DFJSS. A GPHH algorithm evolves dispatching rules (DRs) that are used to make decisions during the scheduling process (i.e. the so-called heuristic template). In DFJSS, there are two kinds of scheduling decisions: the routing decision that allocates each operation to a machine to process it, and the sequencing decision that selects the next job to be processed by each idle machine. The traditional heuristic template makes both routing and sequencing decisions in a non-delay manner, which may have limitations in handling the dynamic environment. In this paper, we propose a novel heuristic template that delays the routing decisions rather than making them immediately. This way, all the decisions can be made under the latest and more accurate information. We propose three different delayed routing strategies, and automatically evolve the rules in the heuristic template by GPHH. We evaluate the newly proposed GPHH with Delayed Routing (GPHH-DR) on a multi-objective DFJSS that optimises the energy efficiency and mean tardiness. The experimental results show that GPHH-DR significantly outperformed the state-of-the-art GPHH methods. We further demonstrated the efficacy of the proposed heuristic template with delayed routing, which suggests the importance of delaying the routing decisions.


Sign in / Sign up

Export Citation Format

Share Document