3 citations · 3 across the 2 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Exact Competitive Ratios of Index Rules for Scheduling with Obligatory Testing
Felix Buld
We revisit scheduling with obligatory testing, where each job consists of two operations: a test with an initially known time and an operation whose processing time is revealed upo…
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…
cs.DS2026
Flow Shop Scheduling with Stochastic Reentry
Maximilian von Aspern, Felix Buld, Michael Pinedo
We study flow shop scheduling with stochastic reentry, where jobs must complete multiple passes through the entire shop, and the number of passes that a job requires for completion…