Metraipolis › archive › dc_e8dee48deb79

Scheduling Jobs with Multiple Operational Modes and Tail Times — arXiv:2609.16001

Source: arXiv (en)
Original: https://arxiv.org/abs/2609.16001
License (as archived): CC0-1.0
Archived: 2026-10-15T21:59:06.807Z
SHA-256 of the archived text: 1c248c209a1450d0c109442c57886f1c855b71480c808792e39a722e51fd0ce2
Stable URL of this page: https://metraipolis.com/documento/dc_e8dee48deb79

How to cite

Scheduling Jobs with Multiple Operational Modes and Tail Times — arXiv:2609.16001 — arXiv (en), https://arxiv.org/abs/2609.16001 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e8dee48deb79 (Metraipolis archive dc_e8dee48deb79, sha256 1c248c209a1450d0c109442c57886f1c855b71480c808792e39a722e51fd0ce2)

BibTeX

@misc{dce8dee48deb79,
  title = {Scheduling Jobs with Multiple Operational Modes and Tail Times — arXiv:2609.16001},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.16001},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e8dee48deb79; sha256 1c248c209a1450d0c109442c57886f1c855b71480c808792e39a722e51fd0ce2},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.16001. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This study explores a scheduling challenge inspired by the production of programmable materials, such as advanced liquid crystal displays. In these systems, the final quality of a product is reached only after a resource-free maturation period, known as a "tail", during which the machine is available for processing other jobs. Each job can be executed in one of several operational modes, with each mode determining a specific combination of machine processing time and subsequent tail duration. The primary task is to simultaneously choose the best mode for every job and determine their processing order. We analyze this model across several key performance goals, including the total time required to finish all jobs, the synchronization of completion times (the gap between the earliest and latest finished products), and the total weighted completion time. Our findings provide a detailed classification of the computational complexity of these problems. We demonstrate that while traditional versions with only one mode per job are simple to solve using standard rules, the introduction of just two modes makes finding optimal solutions for most of these goals computationally difficult. When the number of available modes is large, the complexity increases significantly. However, we also identify specific scenarios that remain efficiently solvable, such as when the processing order is already determined or when the goal is to minimize the average completion time. These results offer theoretical clarity and practical strategies for optimizing complex manufacturing and chemical processes involving forced cooling or maturation stages.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-16 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.16001 — 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-15T21:46:54.561Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-16?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).