Metraipolis › archive › dc_2f608ce787ec
Scheduling and Routing with Degradation-Triggered Job Arrivals: An Application to Forest Firefighting with an Unmanned Aerial Vehicle Fleet — arXiv:2608.18140
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.18140
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T14:06:56.713Z
- SHA-256 of the archived text
116be92f6eb0af6ffb4353dce28efc5ffb8f9461ece3c723908718078dcf40ed- Stable URL of this page
https://metraipolis.com/documento/dc_2f608ce787ec
How to cite
Scheduling and Routing with Degradation-Triggered Job Arrivals: An Application to Forest Firefighting with an Unmanned Aerial Vehicle Fleet — arXiv:2608.18140 — arXiv (en), https://arxiv.org/abs/2608.18140 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2f608ce787ec (Metraipolis archive dc_2f608ce787ec, sha256 116be92f6eb0af6ffb4353dce28efc5ffb8f9461ece3c723908718078dcf40ed)
BibTeX
@misc{dc2f608ce787ec,
title = {Scheduling and Routing with Degradation-Triggered Job Arrivals: An Application to Forest Firefighting with an Unmanned Aerial Vehicle Fleet — arXiv:2608.18140},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.18140},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2f608ce787ec; sha256 116be92f6eb0af6ffb4353dce28efc5ffb8f9461ece3c723908718078dcf40ed},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.18140. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We define an intertwined scheduling and routing problem where new jobs appear due to the degradation of the existing jobs. Specifically, once a job arrives at a potential job location, a time window begins during which the demand of the job can be fulfilled. The demand degrades within the time window, and once it surpasses a particular threshold, it triggers the arrival of new jobs. Each job location inherently possesses an initial default reward, and the presence of an unprocessed job at a location gradually reduces this default value. The overall objective is to maximize the total remaining reward. The underlying motivation of this problem aligns with the proverb ``a stitch in time saves nine," and the problem itself carries practical implications. We focus on the problem in the context of aerial forest firefighting. Each ignited area has a designated action window; delaying intervention causes the fire to grow, diminishing the area's value and causing it to spread to adjacent areas. We develop a mixed-integer programming model that maximizes value retention in wildfire-threatened regions, and a hybrid model based on dynamic constraint generation to enhance the scalability of the model. We evaluate the performance and practicality of our models through computational experiments and a case study. Additionally, we ensure the study's reproducibility and encourage further research by providing open access to the codebase of our model. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-20 in cs.RO). Categorie arXiv: Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2608.18140 — 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-18T14:02:33.832Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-08-20?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).