arXiv:2607. 05177v1 Announce Type: new Abstract: Workforce scheduling is an NP-hard combinatorial optimization problem requiring simultaneous satisfaction of labor regulations, coverage requirements, employee preferences and operational objectives.
SCHEDBench is a natural‑language benchmark that evaluates whether large language models (LLMs) produce schedules that remain constraint‑feasible when the same scheduling problem is expressed in different natural‑language surface forms. The benchmark covers 1,132 instances from job‑shop scheduling, resource‑constrained project scheduling, nurse rostering, and curriculum timetabling, and uses domain‑specific templates and surface‑form variations to generate varied problem statements. Experiments with thirteen frontier and open‑weight LLMs show that models are not reliably invariant to semantically equivalent renderings, with surface‑form variation reducing feasibility and increasing hard‑constraint violations, especially when constraints are reordered.
arXiv:2606. 30650v1 Announce Type: cross Abstract: Educational support services often face a qualified-capacity problem: staff time is scarce, qualifications decay, new support needs can appear before anyone is prepared for them, and training consumes the same hours needed by current students.
arXiv:2607. 22539v1 Announce Type: cross Abstract: The Radiotherapy Scheduling Problem (RTSP) involves determining an optimal schedule for patients undergoing radiation treatments, a task that has a massive impact on clinical outcomes given the central role of radiotherapy in cancer care.
arXiv:2601. 06542v2 Announce Type: replace-cross Abstract: In this paper, we investigate the Resource-Constrained Project Scheduling Problem (RCPSP) with Time-of-Use (TOU) energy tariffs and machine states, a variant of RCPSP for production scheduling, where energy price is part of the criteria and one highly energy-demanding machine can be in one of the following three states: proc, idle, or off.
arXiv:2508.01751v3 Announce Type: replace Abstract: Modeling scheduling problems with conditional time intervals and cumulative functions has become a common approach when using modern commercial con...
arXiv:2607. 16891v1 Announce Type: cross Abstract: A truckload carrier must accept or reject each load tender within seconds.
arXiv:2609.14418v1 Announce Type: cross Abstract: Dynamic multi-mode resource-constrained project scheduling requires decisions to be made under precedence constraints, limited resources, multiple ex...
arXiv:2607. 11725v1 Announce Type: cross Abstract: Prefabricated prefinished volumetric construction moves most building work into module factories, whose production floor operates as a flexible job shop.
arXiv:2603. 23249v2 Announce Type: replace-cross Abstract: Efficient scheduling of directed acyclic graphs (DAGs) is a core problem in large-scale data-intensive computing systems, where query plans, data-processing workloads, and computation graphs consist of dependent tasks competing for limited heterogeneous resource pools.
arXiv:2608. 13209v1 Announce Type: cross Abstract: Many operational decisions are sequences of interventions under a cumulative resource limit, such as a maintenance schedule within a crew-hour budget.
arXiv:2607. 05055v1 Announce Type: new Abstract: Healthcare appointment scheduling remains a persistent operational bottleneck, driven by manual coordination, fragmented legacy systems, and high administrative overhead.