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.
By Corentin Juvigny, Anton\'in Nov\'ak, Jan Mand\'ik, Zden\v{e}k Hanz\'alek
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.
By Ziheng Zhang, Wei Zhang
arXiv:2602. 18109v3 Announce Type: replace Abstract: Real-time schedulers must reason about tight deadlines under strict compute budgets.
By Rong Fu, Yibo Meng, Zeyu Zhang, Ziming Guo, Jia Yee Tan, Xiaojing Du, Simon James Fong
arXiv:2607. 23785v1 Announce Type: cross Abstract: The Simple Temporal Problem (STP) is a core framework for quantitative temporal constraints.
By Johannes K. Fichte, Johanna Groven, Peter Jonsson, Victor Lagerkvist, Jorke M. de Vlas
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.
By Ruisong Zhou, Haijun Zou, Li Zhou, Chumin Sun, Zaiwen Wen
The Simple Temporal Problem (STP) is a core framework for quantitative temporal constraints. As STP data can be inconsistent, we study MAXSTP: compute a maximum-cardinality consistent subset of constraints.
arXiv:2601. 06425v2 Announce Type: replace-cross Abstract: Leakage power in multicore embedded systems now rivals dynamic power, so DVFS schedulers must respect deadlines and thermal limits, not just average makespan.
By Mohammad Pivezhandi, Abusayeed Saifullah, Ali Jannesari
arXiv:2608. 15143v1 Announce Type: new Abstract: Constraint solving is a declarative approach for solving combinatorial satisfaction and optimization problems.
By Tias Guns, Ignace Bleukx, Hendrik Bierlee, Jo Devriendt, Emilio Gamba, Orestis Lomis, Wout Piessens, Thomas Sergeys, Dimos Tsouros, Wout Vanroose, H\'el\`ene Verhaeghe
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.
By Carlos Eduardo Sanoja, Oscar Enrique Moreno Mayz
arXiv:2606. 17266v1 Announce Type: new Abstract: Production planning increasingly has to treat workforce capability as a decision variable: certifications lapse when skills are not maintained, new products require skills the current workforce does not hold, and reskilling competes for the same worker hours needed for production.
By Carlos Eduardo Sanoja
arXiv:2607. 16891v1 Announce Type: cross Abstract: A truckload carrier must accept or reject each load tender within seconds.
By Aswin Chandrasekaran
arXiv:2603. 27628v2 Announce Type: replace Abstract: In dynamic flexible job shops, order arrivals, machine breakdowns, and processing-time deviations continually reshape the scheduling state and the priority trade-offs behind dispatching decisions.
By XinLei Zhou, Jin Huang, Jie Yang, Xinyu Li, Liang Gao