Metraipolis › archive › dc_6cb82d48a65d
Automated Priority Rule Design for the Resource-Constrained Project Scheduling Problem: A Large Language Model-Guided Population-Based Search — arXiv:2609.03754
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.03754
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T02:26:48.858Z
- SHA-256 of the archived text
26ecb3a9203bf2a4219bd3d0aba613f1d6e3dcd40334a3d51409a0a68b165a7e- Stable URL of this page
https://metraipolis.com/documento/dc_6cb82d48a65d
How to cite
Automated Priority Rule Design for the Resource-Constrained Project Scheduling Problem: A Large Language Model-Guided Population-Based Search — arXiv:2609.03754 — arXiv (en), https://arxiv.org/abs/2609.03754 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6cb82d48a65d (Metraipolis archive dc_6cb82d48a65d, sha256 26ecb3a9203bf2a4219bd3d0aba613f1d6e3dcd40334a3d51409a0a68b165a7e)
BibTeX
@misc{dc6cb82d48a65d,
title = {Automated Priority Rule Design for the Resource-Constrained Project Scheduling Problem: A Large Language Model-Guided Population-Based Search — arXiv:2609.03754},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.03754},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6cb82d48a65d; sha256 26ecb3a9203bf2a4219bd3d0aba613f1d6e3dcd40334a3d51409a0a68b165a7e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.03754. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The objective of the resource-constrained project scheduling problem (RCPSP) is to minimize makespan while satisfying precedence and renewable-resource constraints. Priority-rule heuristics construct feasible schedules with low computational cost and explicit decision logic, making them widely used in practice and an attractive alternative to more computationally intensive methods. However, no traditional rule performs consistently well across projects, and researchers have therefore investigated automated priority-rule design. Genetic programming (GP) hyper-heuristics have been the predominant approach to this task, but evolving a high-performing rule may require evaluating many candidate rules on the training projects. Recent advances in large language models (LLMs) make it possible to generate and iteratively revise priority rules using performance feedback. This paper presents an LLM-guided population-based framework for automated priority-rule design. During the offline search, an LLM generates and revises candidate rules, while schedule quality on training projects determines candidate fitness and guides subsequent revisions. At the end of the search, the best rule is returned and applied directly to unseen projects without further search or LLM calls. Experiments show that the LLM-designed rules outperform traditional single rules across the test sets and outperform GP-designed rules obtained under comparable search effort, while remaining competitive with rules obtained from a substantially larger GP search. On large projects, selected LLM-designed rules outperform all considered traditional rules and two genetic algorithm configurations on highly parallel projects. An ablation study examines how changes to the main search components affect performance, while rule analyses describe the structure and decision behavior of the LLM-designed rules. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-04 in math.OC). Categorie arXiv: Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2609.03754 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T02:07:43.341Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).