Fangfang Zhang
ABSTRACT
Multitask learning has attracted widespread attention to handle multiple tasks simultaneously. Multitask genetic programming has been successfully used to learn scheduling heuristics for multiple multi-objective dynamic flexible job shop scheduling tasks simultaneously. With genetic programming, the learned scheduling heuristics consist of terminals that are extracted from the features of specific tasks. However, how to set proper terminals with multiple tasks still needs to be investigated. This paper has investigated the effectiveness of three strategies for this purpose, i.e., intersection strategy to use the common terminals between tasks, separation strategy to apply different terminals for different tasks, and union strategy to utilise all the terminals needed for all tasks. The results show that the union strategy which gives tasks the terminals needed by all tasks performs the best. In addition, we find that the learned routing/sequencing rule by the developed algorithm with union strategy in one multitask scenario can share knowledge between each other. On the other hand and more importantly, the learned routing/sequencing rule can also be specific to their tasks with distinguished knowledge represented by genetic materials.
- Peter Brucker and Rainer Schlie. 1990. Job-shop scheduling with multi-purpose machines. Computing 45, 4 (1990), 369--375.Google Scholar
Digital Library
- Carlos A Coello Coello and Margarita Reyes Sierra. 2004. A study of the parallelization of a coevolutionary multi-objective evolutionary algorithm. In International Conference on Artificial Intelligence. Springer, 688--697.Google ScholarCross Ref
- Marko DJurasevic, Lucija Planinic, Francisco Javier Gil Gala, and Domagoj Jakobovic. 2022. Novel ensemble collaboration method for dynamic scheduling problems. Proceedings of the Genetic and Evolutionary Computation Conference (2022).Google ScholarDigital Library
- Abhishek Gupta, Yew-Soon Ong, and Liang Feng. 2017. Insights on transfer optimization: Because experience is the best teacher. IEEE Transactions on Emerging Topics in Computational Intelligence 2, 1 (2017), 51--64.Google ScholarCross Ref
- Alan S Manne. 1960. On the job-shop scheduling problem. Operations Research 8, 2 (1960), 219--223.Google ScholarDigital Library
- Fangfang Zhang, Yi Mei, Su Nguyen, Kay Chen Tan, and Mengjie Zhang. 2022. Task Relatedness Based Multitask Genetic Programming for Dynamic Flexible Job Shop Scheduling. IEEE Transactions on Evolutionary Computation (2022) Google ScholarDigital Library
- Fangfang Zhang, Yi Mei, Su Nguyen, and Mengjie Zhang. 2022. Multitask Multiobjective Genetic Programming for Automated Scheduling Heuristic Learning in Dynamic Flexible Job Shop Scheduling. IEEE Transactions on Cybernetics (2022) Google ScholarCross Ref
- Fangfang Zhang, Yi Mei, Su Nguyen, and Mengjie Zhang. 2023. Survey on Genetic Programming and Machine Learning Techniques for Heuristic Design in Job Shop Scheduling. IEEE Transactions on Evolutionary Computation (2023) Google ScholarDigital Library
- Fangfang Zhang, Yi Mei, and Mengjie Zhang. 2019. Evolving Dispatching Rules for Multi-objective Dynamic Flexible Job Shop Scheduling via Genetic Programming Hyper-heuristics. In Proceedings of the IEEE Congress on Evolutionary Computation. IEEE, 1366--1373.Google ScholarDigital Library
- Fangfang Zhang, Su Nguyen, Yi Mei, and Mengjie Zhang. 2021. Genetic Programming for Production Scheduling: An Evolutionary Learning Approach. In Machine Learning: Foundations, Methodologies, and Applications. Springer, XXXIII+338 pages. Google ScholarCross Ref
- Eckart Zitzler, Lothar Thiele, Marco Laumanns, Carlos M Fonseca, and Viviane Grunert Da Fonseca. 2003. Performance assessment of multiobjective optimizers: An analysis and review. IEEE Transactions on Evolutionary Computation 7, 2 (2003), 117--132.Google ScholarDigital Library
Index Terms
- An Investigation of Terminal Settings on Multitask Multi-objective Dynamic Flexible Job Shop Scheduling with Genetic Programming
Recommendations
Sample-Aware Surrogate-Assisted Genetic Programming for Scheduling Heuristics Learning in Dynamic Flexible Job Shop Scheduling
GECCO '23: Proceedings of the Genetic and Evolutionary Computation ConferenceGenetic programming (GP) has been successfully introduced to learn scheduling heuristics for dynamic flexible job shop scheduling (DFJSS) automatically. However, the evaluations of GP individuals are normally time-consuming, especially with long DFJSS ...
A preliminary approach to evolutionary multitasking for dynamic flexible job shop scheduling via genetic programming
GECCO '20: Proceedings of the 2020 Genetic and Evolutionary Computation Conference CompanionGenetic programming, as a hyper-heuristic approach, has been successfully used to evolve scheduling heuristics for job shop scheduling. However, the environments of job shops vary in configurations, and the scheduling heuristic for each job shop is ...
Task Relatedness-Based Multitask Genetic Programming for Dynamic Flexible Job Shop Scheduling
Multitask learning has been successfully used in handling multiple related tasks simultaneously. In reality, there are often many tasks to be solved together, and the relatedness between them is unknown in advance. In this article, we focus on the ...
Comments