LLMs can Schedule

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Abgaryan, Henrik, Harutyunyan, Ararat, Cazenave, Tristan
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866909286268928000
author Abgaryan, Henrik
Harutyunyan, Ararat
Cazenave, Tristan
author_facet Abgaryan, Henrik
Harutyunyan, Ararat
Cazenave, Tristan
contents The job shop scheduling problem (JSSP) remains a significant hurdle in optimizing production processes. This challenge involves efficiently allocating jobs to a limited number of machines while minimizing factors like total processing time or job delays. While recent advancements in artificial intelligence have yielded promising solutions, such as reinforcement learning and graph neural networks, this paper explores the potential of Large Language Models (LLMs) for JSSP. We introduce the very first supervised 120k dataset specifically designed to train LLMs for JSSP. Surprisingly, our findings demonstrate that LLM-based scheduling can achieve performance comparable to other neural approaches. Furthermore, we propose a sampling method that enhances the effectiveness of LLMs in tackling JSSP.
format Preprint
id arxiv_https___arxiv_org_abs_2408_06993
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle LLMs can Schedule
Abgaryan, Henrik
Harutyunyan, Ararat
Cazenave, Tristan
Artificial Intelligence
The job shop scheduling problem (JSSP) remains a significant hurdle in optimizing production processes. This challenge involves efficiently allocating jobs to a limited number of machines while minimizing factors like total processing time or job delays. While recent advancements in artificial intelligence have yielded promising solutions, such as reinforcement learning and graph neural networks, this paper explores the potential of Large Language Models (LLMs) for JSSP. We introduce the very first supervised 120k dataset specifically designed to train LLMs for JSSP. Surprisingly, our findings demonstrate that LLM-based scheduling can achieve performance comparable to other neural approaches. Furthermore, we propose a sampling method that enhances the effectiveness of LLMs in tackling JSSP.
title LLMs can Schedule
topic Artificial Intelligence
url https://arxiv.org/abs/2408.06993