2 papers
cs.DS2026
Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model
Felix Buld, Andreas S. Schulz
We study scheduling with testing on a single machine and on identical parallel machines to minimize the total \emph{weighted} completion time in the adversarial model. In this sett…
econ.GN2026
Robust Appointment Scheduling with Waiting Time Guarantees
Carolin Bauerhenne, Rainer Kolisch, Andreas S. Schulz
Appointment scheduling problems under uncertainty encounter a fundamental trade-off between cost minimization and customer waiting times. Most existing studies address this trade-o…