David Fischer

collaborators

2 papers

cs.DS2025

A $(4/3 + ε)$ -Approximation for Preemptive Scheduling with Batch Setup Times

Max A. Deppert, David Fischer, Klaus Jansen

We consider the $NP$ -hard problem $P ∣ pmtn, setup = s_{i} ∣ C_{m a x}$ , the problem of scheduling $n$ jobs, which are div…

cs.DS2025

Robust Scheduling on Uniform Machines -- New Results Using a Relaxed Approximation Guarantee

Hauke Brinkop, David Fischer, Klaus Jansen

We consider the problem of scheduling $n$ jobs on $m$ uniform machines while minimizing the makespan ( $Q ∣∣ C_{m a x}$ ) and maximizing the minimum completion time ( $Q ∣∣ C_{m i n}$ ) in a…

A (4/3+ε)-Approximation for Preemptive Scheduling with Batch Setup Times

Robust Scheduling on Uniform Machines -- New Results Using a Relaxed Approximation Guarantee

A $(4/3 + ε)$ -Approximation for Preemptive Scheduling with Batch Setup Times