TransGP: Task-Conditioned Transformer-Guided Genetic Programming for Multitask Dynamic Flexible Job Shop Scheduling
Meng Xu, Jiao Liu, Hua Yu, Yew Soon Ong

TL;DR
TransGP introduces a task-conditioned Transformer to guide genetic programming, enabling faster, task-specific heuristic generation for dynamic flexible job shop scheduling, outperforming existing methods in convergence and solution quality.
Contribution
It presents a novel framework combining Transformer-based generative modeling with genetic programming for multitask heuristic learning in scheduling.
Findings
TransGP outperforms multitask GP baselines in convergence speed.
TransGP achieves higher solution quality than handcrafted heuristics.
TransGP demonstrates robustness across diverse scheduling scenarios.
Abstract
Hyper-heuristics have become a popular approach for solving dynamic flexible job shop scheduling (DFJSS) problems. They use gradient-free optimization techniques like Genetic Programming (GP) to evolve non-differentiable heuristics. However, conventional GP methods tend to converge slowly because they rely solely on evolutionary search to find good heuristics. Existing multitask GP methods can solve multiple tasks simultaneously and speed up the search by transferring knowledge across similar tasks. But they mostly exchange heuristic building blocks without truly generating heuristics conditioned on task information. In this paper, we aim to accelerate convergence and enable task-specific heuristic generation by incorporating a task-conditioned Transformer model. The Transformer works in two ways. First, it learns the distribution of elite heuristics, biasing the search toward promising…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
