arXiv AI
Implementing Cumulative Functions with Generalized Cumulative Constraints
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv AI
Jul 7
Resource-constrained Project Scheduling with Time-of-Use Energy Tariffs and Machine States: A Logic-based Benders Decomposition Approach
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 AI
Jul 7
CP-WSP: A Declarative CP-SAT Framework for Configurable Multi-Constraint Workforce Scheduling
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.
arXiv AI
4d ago
Factorized Scheduling Principle: Learning Interpretable and Transferable Policies via Structured Additive Functions
arXiv:2609.36578v1 Announce Type: cross Abstract: Scheduling problems arise from repeatedly selecting one item from a set of candidates based on their states. These problems often reduce to assigning...
arXiv Machine Learning
Jun 16
GauS: Differentiable Scheduling Optimization via Gaussian Reparameterization
arXiv:2602. 20427v2 Announce Type: replace Abstract: Efficient operator scheduling is a fundamental challenge in software compilation and hardware synthesis.
arXiv AI
Sep 1
From Metaheuristics to Exact Methods: A CP-SAT Approach for Multi-Objective Healthcare Workforce Scheduling
arXiv:2608.30419v1 Announce Type: new Abstract: Healthcare workforce scheduling is an NP-hard optimization problem requiring simultaneous satisfaction of labor regulations, coverage requirements, emp...
arXiv AI
Jul 8
Implementing Metric Temporal Answer Set Programming
arXiv:2601. 20735v2 Announce Type: replace Abstract: We develop a computational approach to Metric Answer Set Programming (ASP) to allow for expressing quantitative temporal constraints, like durations and deadlines.