A Neighborhood Limitation Method for Job-Shop Scheduling Based on Simulated Annealing

Teramoto, Kenta; Morinaga, Eiji; Wakamatsu, Hidefumi; Arai, Eiji

doi:10.5687/iscie.33.171

Cited by 5 publications

(2 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Improvement heuristics such as bee colony algorithm [48,140], tabu search [180], simulated annealing [225], and genetic algorithms [46,196] have been proposed to find "good enough" solutions for solving JSS problems [3,83,193,221] in a reasonable time. However, they are often not suitable for solving the dynamic JSS problems due to their lack of ability to react in time (i.e., face with rescheduling issue, which is time-consuming).…”

Section: Existing Approachesmentioning

confidence: 99%

Genetic Programming Hyper-heuristics for Dynamic Flexible Job Shop Scheduling

Zhang¹

2021

Preprint

View full text Add to dashboard Cite

Dynamic flexible job shop scheduling (DFJSS) has received widespread attention from academia and industry due to its reflection in real-world scheduling applications such as order picking in the warehouse and the manufacturing industry. It requires complex routing and sequencing decisions under unpredicted dynamic events. Genetic programming, as ahyper-heuristic approach (GPHH), has been successfully applied to evolve scheduling heuristics for DFJSS automatically due to its flexible representation. Although GPHH has achieved certain success in solving the DFJSS problems, there are still some limitations for applying GPHH to DFJSS, particularly in terms of its training efficiency, large search space, search mechanism, and multitask solving ability. The overall goal of this thesis is to develop effective GPHH algorithmsto evolve scheduling heuristics for DFJSS efficiently. Different machine learning techniques, i.e., surrogate, feature selection, specialised genetic operator, and multitask learning, are incorporated in this thesis to tackle the limitations. First, this thesis develops a novel multi-fidelity based surrogate-assisted GPHH for DFJSS to improve the training efficiency of GPHH. Specifically, multi-fidelity based surrogate models are first designed by simplifying the problem to be solved. Then, an effective collaboration mechanism with knowledge transfer is proposed for utilising the advantages of the multifidelity based surrogate models to solve the problem. The results show that the proposed algorithm can dramatically reduce the computational cost of GPHH without sacrificing the performance in all the test scenarios. With the same training time, the proposed algorithm can achieve significantly better performance than its counterparts in most scenarios while no worse in others. Second, this thesis designs a novel two-stage GPHH framework with feature selection to evolve scheduling heuristics for DFJSS automatically. Based on this framework, this thesis further proposes to evolve scheduling heuristics with only the selected features by eliminating the unselected features properly. Specifically, individual adaptation strategies are proposed to generate individuals with only the selected features by utilising the information of both the selected features and the investigated individuals during the feature selection process. The results show that the proposed algorithm can successfully achieve scheduling heuristics with fewer unique features and smaller sizes, which tends to be more interpretable. In addition, the proposed algorithm can evolve comparable scheduling heuristic with that obtained by the traditional GPHH within a much shorter training time. Third, this thesis proposes a novel recombinative mechanism to provide guidance for GPHH based on the importance of subtrees to realise effective and adaptive recombination for parents to produce offspring. Two measures are proposed to measure the importance of all the subtrees of an individual. The first one is based on the frequency of features, and the second is based on the correlation between the behaviour of subtrees and the whole tree (i.e., an individual). The importance information is utilised to decide the crossover points for the parents. The proposed recombinative guidance mechanism attempts to improve the quality of offspring by preserving the promising building-blocks of one parent and incorporating good building-blocks from the other. The results show that the proposed algorithm based on the correlation importance measure performs better than the proposed algorithm based on the feature frequency importance measure. In addition, the proposed algorithm based on the correlation importance measure between the behaviour of subtrees significantly also outperforms the state-of-the-art algorithms on most tested scenarios. Last, this thesis proposes a multitask GPHH approach and a surrogate-assisted multitask GPHH approach to solving multiple DFJSS tasks simultaneously. First, an effective hyper-heuristic multitask algorithm is proposed by adapting the traditional evolutionary multitask algorithms based on the characteristics of GPHH. Second, this thesis develops a novel surrogate-assisted multitask GPHH approach to solving multiple DFJSS tasks by sharing useful knowledge between different DFJSS scheduling tasks. Specifically, the surrogate-assisted multitask GPHH algorithm employs the phenotypic characterisation technique to measure the behaviours of scheduling rules to build a surrogate for each task accordingly. The built surrogates are not only used to improve the efficiency of solving each single DFJSS task but also utilised for knowledge sharing between multiple DFJSS tasks in multitask learning. The results show that the proposed algorithm can significantly improve the quality of scheduling heuristics for all the test scenarios. The results also observe that the proposed algorithms manage to solve multiple tasks collaboratively in terms of the evolved scheduling heuristics for different tasks in a multitask scenario.

show abstract

Section: Existing Approachesmentioning

confidence: 99%

Genetic Programming Hyper-heuristics for Dynamic Flexible Job Shop Scheduling

Zhang¹

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…In this method, several rules for prioritizing facilities and jobs are introduced, and priority of each facility and each job is defined as a weighted sum of priority values of the rules which are calculated exploiting the sorting algorithms. The weights of the rules are optimized using simulated annealing (SA), which was proposed by Kirkpatrik, et al 48) and has been applied to production scheduling [49][50][51][52][53][54] , in a centralized manner so that makespan calculated based on the simulation result is minimized.…”

Section: Introductionmentioning

confidence: 99%

Enhanced Integrated Method of Distributed Scheduling and Simulation for Highly-Distributed Flexible Job Shops

MORINAGA,

YASUDA,

WAKAMATSU

2023

Journal of Smart Processing

Self Cite

View full text Add to dashboard Cite

Recent advances in computer technology and information and communication technology are realizing highly-distributed manufacturing systems (HDMSs) where each machine is computerized and can communicate with other machines. For this type of manufacturing system, a distributed method of discrete event simulation and that of production scheduling were proposed, respectively. Because these methods have the same architecture based on common distributed sequencing algorithms for HDMSs, they can be integrated and the integration makes it possible to generate a better operation plan efficiently. Considering this point, an integrated method of the distributed scheduling and simulation for HDMSs was developed. This paper discusses enhancement of this method. In the integrated method, several dispatching rules for job selection and machine selection are utilized and the weights of the rules are optimized using simulated annealing by an external monitoring system in a centralized manner. This optimization process is improved so that it is performed in a decentralized manner by each machine with synchronization by the monitoring system. The optimization process is enhanced further so that not only non-delay schedules but active schedules can be searched. The effectiveness of this enhanced method was shown by numerical experiments.

show abstract