Large Language Models (LLMs) have shown remarkable capabilities across various domains, but their potential for solving combinatorial optimization problems remains largely unexplored.
Researchers have introduced Starjob, the first supervised dataset for the Job Shop Scheduling Problem (JSSP), consisting of 130k instances designed for training LLMs.
By leveraging the Starjob dataset, researchers fine-tuned the LLaMA 8B 4-bit quantized model with the LoRA method to develop an end-to-end scheduling approach.
Evaluation on standard benchmarks showed that the LLM-based method outperformed traditional Priority Dispatching Rules (PDRs) and achieved notable improvements over state-of-the-art neural approaches, highlighting the potential of LLMs in tackling combinatorial optimization problems.