2 papers
cs.LO2026
Exact SAT and Constraint Programming for Job Shop Scheduling with Time-Varying Peak Power Constraints
Huy Tuan Nguyen, Duc Trung Kim Nguyen, Khanh To Van
The Job Shop Scheduling Problem with Power Requirements (JSPPR) extends the classical job shop scheduling problem by imposing time-varying limits on instantaneous power consumption…
cs.LO2026
A SAT-Based Exact Approach for Radio k-Labeling
Huong Vu Thanh, Duc Dao Van, Khanh To Van
The radio -labeling (or -coloring) problem seeks a minimum-span assignment of nonnegative integer labels to the vertices of a connected graph such that $ |f(u)-f(v)| \ge…