Automated Scheduling Heuristic Generation and Evaluation via Large Language Model
Fei Yu et al.
What the paper says
Scheduling is pivotal in manufacturing, significantly impacting production efficiency, cost optimization, and delivery performance. Due to the complexity of modern manufacturing systems, heuristics are widely adopted for their computational efficiency and interpretability. However, crafting effective heuristics is labor-intensive, necessitating substantial domain expertise and iterative trial-and-error processes. Leveraging the advanced capabilities of Large Language Models (LLMs) in code generation and natural language processing, this paper proposes a Language Scheduling Heuristic (LSH) that harnesses pre-trained LLMs to automatically construct scheduling heuristics without human intervention. The key innovation of LSH lies in its integration of three core components: 1) an LLM module that generates candidate heuristics through specific prompts; 2) an evaluation module that assesses heuristic performance based on a predefined evaluation dataset; and 3) an evolutionary module grounded in an evolutionary paradigm to effectively search for promising heuristics. This synergy enables the automated discovery of high-quality heuristics. On benchmarks for Flow Shop Scheduling Problem (FSP), Job Shop Scheduling Problem (JSP), and Open Shop Scheduling Problem (OSP), our framework demonstrates a powerful capability for automated heuristic generation, leading to solutions that outperform established methods.
Evidence weight
Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40
| F · citation impact | 0.50 × 0.4 = 0.20 |
| M · momentum | 0.50 × 0.15 = 0.07 |
| V · venue signal | 0.50 × 0.05 = 0.03 |
| R · text relevance † | 0.50 × 0.4 = 0.20 |
† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.